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.
This research was supported by the National Science Foundation (Grant IIS-0118635). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation’s Center for Discrete Mathematics and Theoretical Computer Science.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abel, U., Bicker, R.: Determination of All Cutsets Between a Node Pair in an Undirected Graph. IEEE Transactions on Reliability 31, 167–171 (1986)
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)
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)
Bansal, V.K., Misra, K.B., Jain, M.P.: Minimal Pathset and Minimal Cutset Using Search Technique. Microelectr. Reliability 22, 1067–1075 (1982)
Colburn, C.J.: The Combinatorics of Network Reliability. Oxford Univ. Press, New York (1987)
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)
Gusfield, D., Naor, D.: Extracting maximum information about sets of minimum cuts. Algorithmica 10, 64–89 (1993)
Lovász, L.: Submodular functions and convexity. In: Mathematical Programming: The State of the Art, Bonn 1982, pp. 235–257. Springer, Heidelberg (1983)
Kapoor, S., Ramesh, H.: An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27(2), 120–130 (2000)
Oxley, J.: Matroid Theory. Oxford University Press, Oxford (1992)
Provan, J.S., Ball, M.O.: Computing Network Reliability in Time Polynomial in the Number of Cuts. Operations Research 32, 516–526 (1984)
Provan, J.S., Shier, D.R.: A paradigm for listing (s, t) cuts in graphs. Algorithmica 15, 351–372 (1996)
Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237–252 (1975)
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)
Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001)
Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L., Makino, K. (2004). Generating Paths and Cuts in Multi-pole (Di)graphs. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-28629-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22823-3
Online ISBN: 978-3-540-28629-5
eBook Packages: Springer Book Archive