Polynomial-Time Algorithm for the Leafage of Chordal Graphs

Michel Habib, Juraj Stacho. Polynomial-Time Algorithm for the Leafage of Chordal Graphs. In Amos Fiat, Peter Sanders, editors, Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings. Volume 5757 of Lecture Notes in Computer Science, pages 290-300, Springer, 2009. [doi]

@inproceedings{HabibS09-1,
  title = {Polynomial-Time Algorithm for the Leafage of Chordal Graphs},
  author = {Michel Habib and Juraj Stacho},
  year = {2009},
  doi = {10.1007/978-3-642-04128-0_27},
  url = {http://dx.doi.org/10.1007/978-3-642-04128-0_27},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HabibS09-1},
  cites = {0},
  citedby = {0},
  pages = {290-300},
  booktitle = {Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings},
  editor = {Amos Fiat and Peter Sanders},
  volume = {5757},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-04127-3},
}