Algorithms
- 31 May 1975
- journal article
- Published by Elsevier in Advances in Mathematics
- Vol. 16 (2) , 233-245
- https://doi.org/10.1016/0001-8708(75)90153-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The k-factor conjecture is truePublished by Elsevier ,2003
- Efficient Planarity TestingJournal of the ACM, 1974
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Algorithms for constructing graphs and digraphs with given valences and factorsDiscrete Mathematics, 1973
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)Networks, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952