An efficient algorithm for finding maximum cycle packings in reducible flow graphs

Authors:
Xujin Chen;Wenan Zang
Affiliations:
Department of Mathematics, The University of Hong Kong, Hong Kong, China;Department of Mathematics, The University of Hong Kong, Hong Kong, China
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 19
Cited 0

Data structures and network algorithms

Data structures and network algorithms
A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A linear algorithm for finding dominators in flow graphs and related problems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Finding a minimum feedback arc set in reducible flow graphs

Journal of Algorithms
Improved time bounds for the maximum flow problem

SIAM Journal on Computing
A minimax arc theorem for reducible flow graphs

SIAM Journal on Discrete Mathematics
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Parallel algorithms for reducible flow graphs

Journal of Algorithms
Characterizations of Reducible Flow Graphs

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
Packing cycles in graphs

Journal of Combinatorial Theory Series B
Packing cycles in graphs, II

Journal of Combinatorial Theory Series B
A Min-Max Theorem on Feedback Vertex Sets

Mathematics of Operations Research
A TDI System and Its Application to Approximation Algorithms

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Packing cycles in undirected graphs

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Testing flow graph reducibility

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reducible flow graphs occur naturally in connection with flow-charts of computer programs and are used extensively for code optimization and global data flow analysis In this paper we present an O(n2m log(n2/m)) algorithm for finding a maximum cycle packing in any weighted reducible flow graph with n vertices and m arcs.