Results 21 to 30 of about 5,199,165 (252)
Degree Sequence Bound for Join Cardinality Estimation [PDF]
, 2023 Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longer to complete ...
Balazinska, Magda +3 more
core +1 more source
Discussiones Mathematicae Graph Theory, 2020 Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, .
Yin Jian-Hua, Li Sha-Sha
doaj +1 more source
On the Distance Spectral Radius of Trees with Given Degree Sequence
Discussiones Mathematicae Graph Theory, 2020 We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +1 more source
Finding the Zeros of a High-Degree Polynomial Sequence
Journal of Optimization, Differential Equations and Their Applications, 2021 A 1-parameter initial-boundary value problem for a linear spatially 1-dimensional homogeneous degenerate wave equation, posed in a space-time rectangle, in case of strong degeneracy, was reduced to a linear integro-differential equation of convolution ...
Vladimir L. Borsch, Peter I. Kogut
doaj +1 more source
Evaluation of Infrared Detector Response Characteristics Drift Based on Time Sequence [PDF]
Hangkong bingqi, 2023 The response characteristic drift of infrared detector seriously degrades the imaging quality and system performance. Aiming at the lack of effective evaluation index and difficulty in modeling and evaluating the response characteristic drift of infrared
Hu Ruolan, Shang Chao, Wang Jinchun, Peng Jing
doaj +1 more source
A degree sequence Komlós theorem [PDF]
, 2019 An important result of Komlós [Tiling Turán theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for any fixed $x \in (
Hyde, Joseph +2 more
core +1 more source
Extremal trees with fixed degree sequence
, 2021 The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D with respect to various graph invariants. This paper provides a general theorem that covers a large family of invariants for which G(D) or M(D) is ...
Andriantiana, Eric O. D., +8 more
core +1 more source
Multi-switch: A tool for finding potential edge-disjoint 1-factors
Electronic Journal of Graph Theory and Applications, 2021 Let n be even, let π = (d1, ... , dn) be a graphic degree sequence, and let π - k = (d1-k, ... , dn-k) also be graphic. Kundu proved that π has a realization G containing a k-factor, or k-regular graph.
Tyler Seacrest
doaj +1 more source
Graph Editing to a Given Degree Sequence [PDF]
, 2016 We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence where the aim is to obtain a graph with a given degree sequence σσ by at most k vertex or edge deletions and edge additions ...
Golovach, P.A. +3 more
core +1 more source
, 2019 Teorija grafova je od velikog značaja u različitim područjima znanosti. Jednostavni konačni grafovi predstavljaju značajnu vrstu grafova. U ovom završnom radu se razmatra niz stupnjeva konačnog jednostavnog grafa, pojam usko vezan uz osnovne elemente ...
Begović, Dolores
core +1 more source