An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
- Cite this paper as:
- Chen X., Zang W. (2004) An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. In: Fleischer R., Trippen G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg
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.
Keywordsfeedback set cycle packing network flow algorithm complexity
Unable to display preview. Download preview PDF.