205 search results - page 1 / 41 » Pruning 2-Connected Graphs |
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
COMBINATORICS
2004
13 years 4 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
COMBINATORICS
2002
13 years 4 months ago
2002
SIGAL
1990
13 years 9 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes