760 search results - page 11 / 152 » Algorithms for finding clique-transversals of graphs |
RANDOM
1999
Springer
14 years 26 days ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
IPL
2010
13 years 5 months ago
2010
Polynomial algorithms are given for the following two problems:
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
CN
2008
13 years 8 months ago
2008
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...