49 search results - page 1 / 10 » Exact algorithms and applications for Tree-like Weighted Set... |
JDA
2006
14 years 10 months ago
2006
105
Voted
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
91
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
96
Voted
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
101
Voted
WG
2007
Springer
15 years 4 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...