641 search results - page 11 / 129 » On Planar Quasi-Parity Graphs |
104
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
133
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
111
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...
65
Voted
ICCS
2001
Springer
15 years 6 months ago
2001
Springer
JCT
2010
15 years 9 days ago
2010