On the Complexity of Timetable and Multicommodity Flow Problems
- 1 December 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (4) , 691-703
- https://doi.org/10.1137/0205048
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Multi-Commodity Network FlowsOperations Research, 1963
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960
- On Cores and Prime Implicants of Truth FunctionsThe American Mathematical Monthly, 1959
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935