Author:
Fortune Steven,Hopcroft John,Wyllie James
Subject
General Computer Science,Theoretical Computer Science
Reference7 articles.
1. Algorithm for solution of a problem of maximum flow in a network with power estimation;Dinic;Soviet Math. Dokl.,1970
2. On the complexity of timetable and multi-commodity flow problems;Even;SIAM J. Comput.,1976
3. Flow graph reducibility;Hecht;SIAM J. Comput.,1972
4. Dichotomization, reachability, and the forbidden subgraph problem;Hunt;Proc. Eighth Annual ACM Symposium on Theory of Computing,1976
5. The subgraph homeomorphism problem;LaPaugh;Proc. Tenth Annual ACM Symposium on Theory of Computing,1978
Cited by
490 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Constrained flows in networks;Theoretical Computer Science;2024-09
2. Fixed node determination and analysis in directed acyclic graphs of structured networks;Journal of the Franklin Institute;2024-09
3. Fixed-Parameter Tractability of Maximum Colored Path and Beyond;ACM Transactions on Algorithms;2024-06-28
4. A Flat Wall Theorem for Matching Minors in Bipartite Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Edge-Disjoint Paths in Eulerian Digraphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10