643 search results - page 10 / 129 » Supereulerian planar graphs |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
DM
2002
13 years 7 months ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
ESA
2004
Springer
14 years 29 days ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...