37 search results - page 3 / 8 » On the Degree Sequences of Random Outerplanar and Series-Par... |
COLOGNETWENTE
2008
13 years 7 months ago
2008
CPC
2008
13 years 5 months ago
2008
COMBINATORICS
2006
13 years 5 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
ALGORITHMICA
2007
13 years 5 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...