Packing cuts in undirected graphs
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Packing cycles in undirected graphsJournal of Algorithms, 2003
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJournal of Algorithms, 1998
- On a matroid defined by ear-decompositions of graphsCombinatorica, 1996
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Conservative weightings and ear-decompositions of graphsCombinatorica, 1993
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991
- A Minimax Theorem for Directed GraphsJournal of the London Mathematical Society, 1978
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961