5 search results - page 1 / 1 » Graphic sequences with a realization containing a generalize... |
DM
2008
13 years 11 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
ARSCOM
2007
13 years 11 months ago
2007
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
DM
2008
13 years 11 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
BMCBI
2005
13 years 11 months ago
2005
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
DCC
2007
IEEE
14 years 10 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...