This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1994). Finding all minimal separators of a graph. In: Kloks, T. (eds) Treewidth. Lecture Notes in Computer Science, vol 842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045386
Download citation
DOI: https://doi.org/10.1007/BFb0045386
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58356-1
Online ISBN: 978-3-540-48672-5
eBook Packages: Springer Book Archive