1461 search results - page 3 / 293 » Complexity of Graph Covering Problems |
WAOA
2005
Springer
14 years 28 days 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...
MICS
2010
13 years 5 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
STOC
2010
ACM
14 years 8 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
SPAA
2010
ACM
14 years 8 days 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...