Advertisement

Generating Paths and Cuts in Multi-pole (Di)graphs

  • Endre Boros
  • Khaled Elbassioni
  • Vladimir Gurvich
  • Leonid Khachiyan
  • Kazuhisa Makino
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3153)

Abstract

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set \(\mathcal P\) of (source-sink) pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of \(\mathcal P\). For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. For directed graphs both of these problems are NP-hard. We also give a polynomial delay algorithm for enumerating minimal sets of arcs connecting respectively two given nodes s 1 and s 2 to a given vertex t 1, and each vertex of a given subset of vertices T 2.

Keywords

Span Tree Undirected Graph Steiner Tree Conjunctive Normal Form Network Reliability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abel, U., Bicker, R.: Determination of All Cutsets Between a Node Pair in an Undirected Graph. IEEE Transactions on Reliability 31, 167–171 (1986)CrossRefGoogle Scholar
  2. 2.
    Boros, E., Elbassioni, K., Gurvich, V.: Algorithms for Enumerating Circuits in Matroids. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 485–494. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: On enumerating minimal dicuts and strongly connected subgraphs. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 152–162. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Bansal, V.K., Misra, K.B., Jain, M.P.: Minimal Pathset and Minimal Cutset Using Search Technique. Microelectr. Reliability 22, 1067–1075 (1982)CrossRefGoogle Scholar
  5. 5.
    Colburn, C.J.: The Combinatorics of Network Reliability. Oxford Univ. Press, New York (1987)Google Scholar
  6. 6.
    Curet, N.D., DeVinney, J., Gaston, M.E.: An efficient network flow code for finding all minimum cost s-t cutsets. Comp. and Oper. Res. 29, 205–219 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Gusfield, D., Naor, D.: Extracting maximum information about sets of minimum cuts. Algorithmica 10, 64–89 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Lovász, L.: Submodular functions and convexity. In: Mathematical Programming: The State of the Art, Bonn 1982, pp. 235–257. Springer, Heidelberg (1983)Google Scholar
  9. 9.
    Kapoor, S., Ramesh, H.: An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27(2), 120–130 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Oxley, J.: Matroid Theory. Oxford University Press, Oxford (1992)zbMATHGoogle Scholar
  11. 11.
    Provan, J.S., Ball, M.O.: Computing Network Reliability in Time Polynomial in the Number of Cuts. Operations Research 32, 516–526 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Provan, J.S., Shier, D.R.: A paradigm for listing (s, t) cuts in graphs. Algorithmica 15, 351–372 (1996)zbMATHMathSciNetGoogle Scholar
  13. 13.
    Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237–252 (1975)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Uno, T.: An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph. In: The Proceedings of the 7th Annual International Symposium on Algorithms and Computation ISAAC, pp. 166–173 (1996)Google Scholar
  15. 15.
    Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001)Google Scholar
  16. 16.
    Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Endre Boros
    • 1
  • Khaled Elbassioni
    • 1
  • Vladimir Gurvich
    • 1
  • Leonid Khachiyan
    • 2
  • Kazuhisa Makino
    • 3
  1. 1.RUTCORRutgers UniversityPiscatawayUSA
  2. 2.Department of Computer ScienceRutgers UniversityPiscatawayUSA
  3. 3.Division of Systems Science, Graduate School of Engineering ScienceOsaka UniversityToyonaka, OsakaJapan

Personalised recommendations