1591 search results - page 88 / 319 » Random lifts of graphs |
158
click to vote
APPROX
2004
Springer
15 years 11 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 ...
379
click to vote
PAMI
2010
15 years 4 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
182
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...
182
click to vote
WDAG
2005
Springer
15 years 11 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 ...
173
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...