scientific article; zbMATH DE number 2086917

zbMATH Open1049.90113MaRDI QIDQ4737522FDOQ4737522

Authors: Klaus M. Wenger 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370109.htm

Title of this publication is not available (Why is that?)

Recommendations

• A fast algorithm for cactus representations of minimum cuts
• scientific article; zbMATH DE number 1187160
• A near-linear time algorithm for constructing a cactus representation of minimum cuts
• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (3)

• Computing compatible tours for the symmetric traveling salesman problem
• Generating partitions of a graph into a fixed number of minimum weight cuts
• Privatized rural postman problems

Uses Software

• TSPLIB
• PORTA

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737522)