Computational Complexity of Combinatorial and Graph-Theoretic Problems
- 1 January 2011
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Fast algorithms for bin packingPublished by Elsevier ,2007
- Matroid intersection algorithmsMathematical Programming, 1975
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Nondeterministic AlgorithmsJournal of the ACM, 1967
- On the Significance of Solving Linear Programming Problems with Some Integer VariablesEconometrica, 1960
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959