Computing treewidth and minimum fill-in : all you need are the minimal separators

A.J.J. Kloks; H.L. Bodlaender; H. Müller; D. Kratsch

doi:10.1007/3-540-57273-2_61

Computing treewidth and minimum fill-in : all you need are the minimal separators

A.J.J. Kloks, H.L. Bodlaender, H. Müller, D. Kratsch

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

51 Citations (Scopus)

Original language	English
Title of host publication	Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993)
Editors	T. Lengauer
Place of Publication	Berlin
Publisher	Springer
Pages	260-271
ISBN (Print)	3-540-57273-2
DOIs	https://doi.org/10.1007/3-540-57273-2_61
Publication status	Published - 1993

Publication series

Name	Lecture Notes in Computer Science
Volume	726
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-57273-2_61

Cite this

Kloks, A. J. J., Bodlaender, H. L., Müller, H., & Kratsch, D. (1993). Computing treewidth and minimum fill-in : all you need are the minimal separators. In T. Lengauer (Ed.), Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993) (pp. 260-271). (Lecture Notes in Computer Science; Vol. 726). Springer. https://doi.org/10.1007/3-540-57273-2_61

@inproceedings{0ee71cca7d714db78b3da6ee846db2f0,

title = "Computing treewidth and minimum fill-in : all you need are the minimal separators",

author = "A.J.J. Kloks and H.L. Bodlaender and H. M{\"u}ller and D. Kratsch",

year = "1993",

doi = "10.1007/3-540-57273-2_61",

language = "English",

isbn = "3-540-57273-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "260--271",

editor = "T. Lengauer",

booktitle = "Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993)",

}

Kloks, AJJ, Bodlaender, HL, Müller, H & Kratsch, D 1993, Computing treewidth and minimum fill-in : all you need are the minimal separators. in T Lengauer (ed.), Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993). Lecture Notes in Computer Science, vol. 726, Springer, Berlin, pp. 260-271. https://doi.org/10.1007/3-540-57273-2_61

Computing treewidth and minimum fill-in : all you need are the minimal separators. / Kloks, A.J.J.; Bodlaender, H.L.; Müller, H. et al.
Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993). ed. / T. Lengauer. Berlin: Springer, 1993. p. 260-271 (Lecture Notes in Computer Science; Vol. 726).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Computing treewidth and minimum fill-in : all you need are the minimal separators

AU - Kloks, A.J.J.

AU - Bodlaender, H.L.

AU - Müller, H.

AU - Kratsch, D.

PY - 1993

Y1 - 1993

U2 - 10.1007/3-540-57273-2_61

DO - 10.1007/3-540-57273-2_61

M3 - Conference contribution

SN - 3-540-57273-2

T3 - Lecture Notes in Computer Science

SP - 260

EP - 271

BT - Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993)

A2 - Lengauer, T.

PB - Springer

CY - Berlin

ER -

Kloks AJJ, Bodlaender HL, Müller H, Kratsch D. Computing treewidth and minimum fill-in : all you need are the minimal separators. In Lengauer T, editor, Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993). Berlin: Springer. 1993. p. 260-271. (Lecture Notes in Computer Science). doi: 10.1007/3-540-57273-2_61