A polynomial algorithm for b-matchings: An alternative approach
- 13 February 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 24 (3) , 153-157
- https://doi.org/10.1016/0020-0190(87)90178-5
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A strongly polynomial minimum cost circulation algorithmCombinatorica, 1985
- An algorithmic proof of Tutte's f-factor theoremJournal of Algorithms, 1985
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Some Properties of Graphs with Multiple EdgesCanadian Journal of Mathematics, 1965