Ton Kloks, Dieter Kratsch. Finding All Minimal Separators of a Graph. In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 759-768, Springer, 1994.
@inproceedings{KloksK94, title = {Finding All Minimal Separators of a Graph}, author = {Ton Kloks and Dieter Kratsch}, year = {1994}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/KloksK94}, cites = {0}, citedby = {0}, pages = {759-768}, booktitle = {STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings}, editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner}, volume = {775}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-57785-8}, }