An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs

  • Xujin Chen
  • Wenan Zang
Conference paper

DOI: 10.1007/978-3-540-30551-4_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3341)
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

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.

Keywords

feedback set cycle packing network flow algorithm complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Xujin Chen
    • 1
  • Wenan Zang
    • 1
  1. 1.Department of MathematicsThe University of Hong KongHong KongChina

Personalised recommendations