Results 261 to 270 of about 5,011,430 (289)
Some of the next articles are maybe not open access.
ACM Transactions on Database Systems
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 than one generated with the true cardinality.
Kyle Deeds +3 more
openaire +1 more source
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 than one generated with the true cardinality.
Kyle Deeds +3 more
openaire +1 more source
Line‐graphical degree sequences
Journal of Graph Theory, 1980AbstractA degree sequence π = (d1, d2,…,dp), with d1 ≥ d2 ≥…≥ dp, is line graphical if it is realized by the line graph of some graph. Degree sequences with line‐graphical realizations are characterized for the cases d1 = p ‐ 1, d1 = p ‐ 2, d1 ≤ 3, and d1 = dp.
openaire +1 more source
A remark on degree sequences of multigraphs
Mathematical Methods of Operations Research, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dirk Meierling, Lutz Volkmann
openaire +2 more sources
Degrees of types and independent sequences
Journal of Symbolic Logic, 1983The theories considered here are countable and complete, and the types are all complete too. Let T be an L-theory. A sequence σ = (σn(ν))n∈ω of L-formulas is said to be independent (with respect to T) if for each α ∈ 2<ω, the sentenceis in T. As an example, let T = Th(Z, +), and let σ be the sequence of formulas saying (in the language of groups) ν ...
openaire +2 more sources
Signed degree sequences and multigraphs
Journal of Graph Theory, 2002AbstractWe give necessary and sufficient conditions for the existence of a signed r‐multigraph with a prescribed signed degree sequence. © 2002 Wiley Periodicals, Inc.
openaire +2 more sources
Degree sequences with repeated values.
Ars Comb., 2001The authors study the existence of graphic sequences containing a given repetition sequence. Here a non-increasing sequence \(\mathcal D\) is said to contain a repetition sequence \(\mathcal D^\ast \) if \(\mathcal D^\ast \) is its subsequence, all values in \(\mathcal D - \mathcal D^\ast \) are distinct, and each entry of \(\mathcal D^\ast \) occurs ...
Guantao Chen +4 more
openaire +2 more sources
Spectral Radius and Degree Sequence
Mathematische Nachrichten, 1988AbstractFor a nonregular graph there is exactly one value of p such that the p‐mean of its degree sequence is equal to the spectral radius. We try to investigate the structural content of this so‐called spectral mean characteristic; in particular, we characterize the connected graphs of spectral mean characteristic 2.
openaire +2 more sources
Note on Sombor index of connected graphs with given degree sequence
Discrete Applied Mathematics, 2023Muhuo Liu
exaly
Degree sequence conditions for a graph to be disjoint path coverable
Discrete Applied Mathematics, 2023Jixiang Meng, Eminjan Sabir
exaly
On the extremal values for the Mostar index of trees with given degree sequence
Applied Mathematics and Computation, 2021Shuchao Li, Kecai Deng
exaly