A note on domino treewidth.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1999)
- Volume: 3, Issue: 4, page 141-150
- ISSN: 1365-8050
Access Full Article
top
How to cite
topBodlaender, Hans L.. "A note on domino treewidth.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 3.4 (1999): 141-150. <http://eudml.org/doc/120091>.
@article{Bodlaender1999,
author = {Bodlaender, Hans L.},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {graph algorithms; tree decompositions; domino treewidth},
language = {eng},
number = {4},
pages = {141-150},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {A note on domino treewidth.},
url = {http://eudml.org/doc/120091},
volume = {3},
year = {1999},
}
TY - JOUR
AU - Bodlaender, Hans L.
TI - A note on domino treewidth.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1999
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 3
IS - 4
SP - 141
EP - 150
LA - eng
KW - graph algorithms; tree decompositions; domino treewidth
UR - http://eudml.org/doc/120091
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.