Skip to main content
SpringerLink
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Reducible flow graphs occur naturally in connection with flowcharts of computer programs and are used extensively for code optimization and global data flow analysis. In this paper we present an O(n2 log(n2/m)) algorithm for finding a maximum cycle packing in any weighted reducible flow graph with n vertices and m arcs; our algorithm heavily relies on Ramachandran's earlier work concerning reducible flow graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Hong Kong, Pokfulam Road, Hong Kong

    Xujin Chen & Wenan Zang

Authors
  1. Xujin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenan Zang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenan Zang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, X., Zang, W. An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. Algorithmica 44, 195–211 (2006). https://doi.org/10.1007/s00453-005-1174-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-005-1174-x

Search

Navigation