Sciweavers

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

68

Voted

DAM
2010

53views more DAM 2010»

Minimum cut bases in undirected networks

15 years 4 months ago

Minimum cut bases in undirected networks

Download globopt.dsi.unifi.it

Florentine Bunke, Horst W. Hamacher, Francesco Maf

Real-time Traffic

DAM 2010 |

claim paper

Related Content

» Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities

» Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree

» Electrical Flows Laplacian Systems and Faster Approximation of Maximum Flow in Undirected ...

» An Improved Approximation Algorithm for Multiway Cut

» Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

» A New ILP Formulation for 2RootConnected PrizeCollecting Steiner Networks

» Strong Formulations for 2NodeConnected Steiner Network Problems

» Optimal 3terminal cuts and linear programming

» Computing minimum cuts by randomized search heuristics

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DAM
Authors	Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn

Comments (0)