Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

SWAT
2000
Springer

favoriteEmaildiscussreport

98views Algorithms» more SWAT 2000»

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph

13 years 8 months ago

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph

Download www.orsj.or.jp

Toshimasa Ishii, Hiroshi Nagamochi

Real-time Traffic

Algorithms | SWAT 2000 |

claim paper

Related Content

» On the Minimum kConnectivity Repair in Wireless Sensor Networks

» Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum kWay Cut...

» Encompassing colored planar straight line graphs

» The Bidimensional Theory of BoundedGenus Graphs

» Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded L...

» Minimum Augmentation of EdgeConnectivity with Monotone Requirements in Undirected Graphs

» Approximation Schemes for Minimum 2Connected Spanning Subgraphs in Weighted Planar Graphs

» Augmented tree partitioning for interactive image segmentation

» Characterizing Families of Cuts That Can Be Represented by AxisParallel Rectangles

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	SWAT
Authors	Toshimasa Ishii, Hiroshi Nagamochi

Comments (0)