Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Algorithms and Computation (ISAAC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3341))

Included in the following conference series:

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(n 2 m log(n 2/m)) algorithm for finding a maximum cycle packing in any weighted reducible flow graph with n vertices and m arcs.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows – Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, New Jersey (1993)

    Google Scholar 

  2. Ahuja, R.K., Orlin, J.B., Tarjan, R.E.: Improved time bounds for the maximum flow problem. SIAM J. Comput. 18, 939–954 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aho, A.V., Ullman, J.D.: Principle of Compiler Design. Addison-Wesley, Reading (1977)

    Google Scholar 

  4. Cai, M.C., Deng, X.T., Zang, W.: A TDI system and its application to approximation algorithms. In: Proc. 39th IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, pp. 227–233 (1998)

    Google Scholar 

  5. Cai, M.C., Deng, X.T., Zang, W.: An approximation algorithm for feedback vertex sets in tournaments. SIAM J. Comput. 30, 1993–2007 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cai, M.C., Deng, X.T., Zang, W.: A min-max theorem on feedback vertex sets. Math. Oper. Res. 27, 361–371 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms 48, 239–256 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ding, G., Zang, W.: Packing cycles in graphs. J. Combin. Theory Ser. B 86, 381–407 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ding, G., Xu, Z., Zang, W.: Packing cycles in graphs, II. J. Combin. Theory Ser. B 87, 244–253 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dinits, E.A.: Algorithms for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady 11, 1277–1280 (1970)

    MATH  Google Scholar 

  11. Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton (1962)

    MATH  Google Scholar 

  12. Frank, A., Gyarfas, A.: Directed graphs and computer programs. Problemes Combinatoires et Theorie des Graphes, Colloque Internationaux C.N.R.S. 260, 157–158 (1976)

    Google Scholar 

  13. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  14. Goldberg, A., Tarjan, R.E.: A new approach to the maximum flow problem. In: Proc. 18th Annu. ACM Symp. on Theory of Computing, pp. 136–146 (1985)

    Google Scholar 

  15. Harel, D.: A linear algorithm for finding dominators in flow graphs and related problems. In: Proc. 17th Annual ACM Symp. on Theory of Computing, pp. 185–194 (1984)

    Google Scholar 

  16. Hecht, M.S., Ullman, J.D.: Flow graph reducibility. SIAM J. Comput. 1, 188–202 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  17. Hecht, M.S., Ullman, J.D.: Characterizations of reducible graphs. J. Assoc. Comput. Mach. 21, 367–375 (1974)

    MATH  MathSciNet  Google Scholar 

  18. Ramachandran, V.: Finding a minimum feedback arc set in reducible flow graphs. J. Algorithms 9, 299–313 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  19. Ramachandran, V.: A minimax arc theorem for reducible flow graphs. SIAM J. Discrete Math. 3, 554–560 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. Ramachandran, V.: Parallel algorithms for reducible flow graphs. J. Algorithms 23, 1–31 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  21. Shamir, A.: A linear time algorithm for finding minimum cutsets in reducible graphs. SIAM J. Comput. 8, 645–655 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tarjan, R.E.: Depth-first search and linear graph algorithm. SIAM J. Comput. 1, 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  23. Tarjan, R.E.: Testing flow reducibility. J. Comput. System Sci. 9, 355–365 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  24. Tarjan, R.E.: Data Structure and Network Algorithms. SIAM, Philadelphia (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Hong Kong, Hong Kong, China

    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

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Fudan University, 200433, Shanghai, China

    Rudolf Fleischer

  2. Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong

    Gerhard Trippen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-540-30551-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30551-4_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24131-7

  • Online ISBN: 978-3-540-30551-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics