Results 241 to 250 of about 3,049,614 (273)
Some of the next articles are maybe not open access.
b-matching degree-sequence polyhedra
Combinatorica, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cunningham, William H. +1 more
openaire +2 more sources
On Planar Graphical Degree Sequences
SIAM Journal on Applied Mathematics, 1977We determine completely which graphical sequences $d_1 \geqq d_2 \geqq \cdots \geqq d_p $ with $d_1 - d_p = 1$ are planar graphical, and with a small number of exceptions determine the same result when $d_1 - d_p = 2$.We also give simple necessary conditions (in the form of upper bounds on $\sum\nolimits_{i = 1}^k {di} $) for a graphical sequence to be
Schmeichel, E. F., Hakimi, S. L.
openaire +1 more source
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
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
Journal of Graph Theory, 1999
Summary: We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of \textit{P. Katerinis} [J. Graph Theory 9, No. 4, 513-521 (1985; Zbl 0664.05047)] and \textit{P. Fraisse}, \textit{P. Hell} and \textit{D. G. Kirkpatrick} [Graphs Comb.
Anstee, R. P., Nam, Yunsun
openaire +2 more sources
Summary: We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of \textit{P. Katerinis} [J. Graph Theory 9, No. 4, 513-521 (1985; Zbl 0664.05047)] and \textit{P. Fraisse}, \textit{P. Hell} and \textit{D. G. Kirkpatrick} [Graphs Comb.
Anstee, R. P., Nam, Yunsun
openaire +2 more sources
Descending sequences of degrees
Journal of Symbolic Logic, 1975Our unexplained notation is that of Rogers [4]. Let P ⊆ 2N × 2N. We call a sequence <An: n ∈ N> of subsets of N a P-sequence iff ∀n(An+1 = the unique B such that P(An, B)).Theorem. Let P ⊆ 2N × 2N be arithmetical. Then there is no P-sequence <An: n ∈ N> such that ∀n(A′n+1 ≤T An).This theorem improves a result of Friedman [2] who showed that
openaire +2 more sources
Degree sequences of k-multi-hypertournaments
Applied Mathematics-A Journal of Chinese Universities, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Cancer epigenetics in clinical practice
Ca-A Cancer Journal for Clinicians, 2023Veronica Davalos, Manel Esteller
exaly