Abstract
Let x and y be two nodes being not connected by an edge in an undirected connected non-complete graph. We present here an algorithm which finds a minimum cut-set of the graph by which x and y are separated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arany, I., Smyth, W. F. and Szóda, L., An improved method for reducing the bandwidth for sparse symmetric matrices, Proc. IFIP Congr. '71, North-Holland Publ. Co., Amsterdam, pp. 1246–1250 (1972).
Arany, I., An algorithm for finding all peripheral nodes, Bulletins for Applied Mathematics ed. Technical University of Budapest, 38, pp. 89–101 (1985).
Arany, I., Another algorithm for finding level structures with small width, W. P. MG/9., ed. Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, (1985).
George, J. A. and Liu, J. W. H., Computer Solution of Large Sparse Positive Definite Systems, Prentice Hall Inc., Englewood Cliffs, New Jersey, (1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Arany, I. (1986). An algorithm for getting a minimum cut-set of a graph. In: Prékopa, A., Szelezsáan, J., Strazicky, B. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0043820
Download citation
DOI: https://doi.org/10.1007/BFb0043820
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16854-6
Online ISBN: 978-3-540-47138-7
eBook Packages: Springer Book Archive