A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- 1 April 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 42 (1) , 471-487
- https://doi.org/10.1007/bf01589417
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fibonacci Heaps And Their Uses In Improved Network Optimization AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Two algorithms for weighted matroid intersectionMathematical Programming, 1986
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Efficient algorithms for a family of matroid intersection problemsJournal of Algorithms, 1984
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970