Sciweavers

4865 search results - page 59 / 973
» The Complexity of Graph Connectivity
Sort
View
119
Voted
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 2 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
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...
Bruno F. Ribeiro, Donald F. Towsley
86
Voted
FCT
2009
Springer
15 years 9 months ago
On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
Subhas Kumar Ghosh, Koushik Sinha
WG
2009
Springer
15 years 7 months ago
Cycles, Paths, Connectivity and Diameter in Distance Graphs
Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz ...
SWAT
2000
Springer
94views Algorithms» more  SWAT 2000»
15 years 6 months ago
Embeddings of k-Connected Graphs of Pathwidth k
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowsk...