108 search results - page 2 / 22 » On the computational complexity of partial covers of Theta g... |
WG
1994
Springer
13 years 9 months ago
1994
Springer
WAOA
2005
Springer
13 years 10 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...
GC
2010
Springer
13 years 3 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
SPAA
2010
ACM
13 years 9 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...