Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

70

SODA
2010
ACM

140views Algorithms» more SODA 2010»

Vertices of Degree k in Random Maps

15 years 11 months ago

Vertices of Degree k in Random Maps

Download halma.mpi-inf.mpg.de

Daniel Johannsen, Konstantinos Panagiotou

Real-time Traffic

Discrete Algorithms | Random Maps | SODA 2010 |

claim paper

Related Content

» High Degree Vertices Eigenvalues and Diameter of Random Apollonian Networks

» Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree

» Distribution of Vertex Degree in WebGraphs

» Scale Free Properties of Random kTrees

» Nearoptimum Universal Graphs for Graphs with Bounded Degrees

» The Spectral Gap of a Random Subgraph of a Graph

» A NonMarkovian Coupling for Randomly Sampling Colorings

» A new approach to the orientation of random hypergraphs

» Random mappings with exchangeable indegrees

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Daniel Johannsen, Konstantinos Panagiotou

Comments (0)