Back to search
On the Complexity of Timetable and Multicommodity Flow Problems
Data up to Jan 2025
Published1976
Citations1,045
References8
Total Citations Per Year
Abstract
References (8)
Reducibility among Combinatorial Problems
1972 • 10,743 citations
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
1973 • 2,802 citations
A Computing Procedure for Quantification Theory
1960 • 2,592 citations
On Representatives of Subsets
1935 • 2,017 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
Multi-Commodity Network Flows
1963 • 385 citations
The theory of graphs and its applications
1962 • 136 citations
On Cores and Prime Implicants of Truth Functions
1959 • 100 citations
Cited By (0)
Loading...