Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference11 articles.
1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows—theory, algorithms, and applications. Prentice Hall Inc., Englewood Cliffs
2. Chen X, Zang W (2006) An efficient algorithm for finding maximum cycle packings in reducible flow graphs. Algorithmica 44(3):195–211
3. Frank A, Gyarfas A (1976) Directed graphs and computer programs. Problemes Combinatoires et Theorie des Graphes 260:157–158
4. Hecht MS (1977) Flow analysis of computer programs. North-Holland, New York
5. Hecht MS, Ullman JD (1972) Flow graph reducibility. SIAM J Comput 1(2):188–202
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Papers and Algorithms;Feedback Arc Set;2022
2. On ideal semicomplete digraphs;Information Processing Letters;2020-05