1949 search results - page 48 / 390 » Random graphs on surfaces |
IJCAI
2001
15 years 1 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
DCG
2008
14 years 12 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
FCT
2009
Springer
15 years 6 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
