1542 search results - page 103 / 309 » The metamathematics of random graphs |
164
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
186
click to vote
MICCAI
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
186
click to vote
WDAG
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
175
click to vote
COLOGNETWENTE
2009
15 years 7 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
150
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...