Forests, frames, and games: Algorithms for matroid sums and applications
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6) , 465-497
- https://doi.org/10.1007/bf01758774
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Matroid Theory and its Applications in Electric Network Theory and in StaticsPublished by Springer Nature ,1989
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- Combinatorial TheoryPublished by Springer Nature ,1979
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- The principal minors of a matroidLinear Algebra and its Applications, 1971
- A constructive graph-theoretic solution of the Shannon switching gameIEEE Transactions on Circuit Theory, 1970
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965