Results 271 to 280 of about 971,776 (299)
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 +1 more source
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 +1 more source
Enumeration of graphs by degree sequence
Journal of Graph Theory, 1979AbstractThe degree sequence (d0, d1, …, dp‐1) of a graph G of order p is defined by dk = the number of points of G of degree k. Methods of Robinson are extended to produce a generating function F(x0, x1, x2, …) where the coefficient of x…x is the number of graphs of order p having degree sequence (d0, …, dp‐1).
openaire +1 more source
Subgraphs and Their Degree Sequences of a Digraph
Journal of the Franklin Institute, 1980Abstract The paper presents general conditions that are necessary and sufficient for the existence of a (p,s) subgraph with prescribed degrees of a given digraph. It is shown that the subgraph problem of a digraph, the degree sequence problem of a digraph, the subgraph problem of a graph and the degree sequence problem of a graph can all be treated ...
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 +1 more source
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
Random Structures and Algorithms, 2023Anita Liebenau
exaly
Note on Sombor index of connected graphs with given degree sequence
Discrete Applied Mathematics, 2023Muhuo Liu
exaly