Anne Berry, Jean Paul Bordat, Pinar Heggernes. Recognizing Weakly Triangulated Graphs by Edge Separability. In Magnús M. Halldórsson, editor, Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings. Volume 1851 of Lecture Notes in Computer Science, pages 139-149, Springer, 2000. [doi]
@inproceedings{BerryBH00, title = {Recognizing Weakly Triangulated Graphs by Edge Separability}, author = {Anne Berry and Jean Paul Bordat and Pinar Heggernes}, year = {2000}, url = {http://link.springer.de/link/service/series/0558/bibs/1851/18510139.htm}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/BerryBH00}, cites = {0}, citedby = {0}, pages = {139-149}, booktitle = {Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings}, editor = {Magnús M. Halldórsson}, volume = {1851}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-67690-2}, }