20 search results - page 2 / 4 » On the Minimum Augmentation of an l-Connected Graph to a k-C... |
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
CATS
2007
13 years 7 months ago
2007
ESA
2005
Springer
13 years 11 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...
ICIP
2008
IEEE
14 years 7 days ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
GD
2003
Springer
13 years 11 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...