Abstract
In this paper we give an efficient algorithm to find all minimal vertex separators of an undirected graph. The algorithm needs polynomial time per separator that is found.
Cite
CITATION STYLE
APA
Kloks, T., & Kratsch, D. (1994). Finding all minimal separators of a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 759–768). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_188
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free