An improved algorithm for finding tree decompositions of small width

Ljubomir Perković; Bruce Reed

doi:10.1007/3-540-46784-x_15

An improved algorithm for finding tree decompositions of small width

Ljubomir Perković
, Bruce Reed

Drexel University
CNRS Centre National de la Recherche Scientifique

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings
Editors	Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz
Publisher	Springer Verlag
Pages	148-154
Number of pages	7
ISBN (Print)	3540667318, 9783540667315
DOIs	https://doi.org/10.1007/3-540-46784-x_15
State	Published - 1999
Externally published	Yes
Event	25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999 - Ascona, Switzerland Duration: Jun 17 1999 → Jun 19 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1665
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999
Country/Territory	Switzerland
City	Ascona
Period	6/17/99 → 6/19/99

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-46784-x_15

Cite this

Perković, L., & Reed, B. (1999). An improved algorithm for finding tree decompositions of small width. In P. Widmayer, G. Neyer, & S. Eidenbenz (Eds.), Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings (pp. 148-154). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1665). Springer Verlag. https://doi.org/10.1007/3-540-46784-x_15

An improved algorithm for finding tree decompositions of small width. / Perković, Ljubomir; Reed, Bruce.
Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings. ed. / Peter Widmayer; Gabriele Neyer; Stephan Eidenbenz. Springer Verlag, 1999. p. 148-154 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1665).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Perković, L & Reed, B 1999, An improved algorithm for finding tree decompositions of small width. in P Widmayer, G Neyer & S Eidenbenz (eds), Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1665, Springer Verlag, pp. 148-154, 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999, Ascona, Switzerland, 6/17/99. https://doi.org/10.1007/3-540-46784-x_15

Perković L, Reed B. An improved algorithm for finding tree decompositions of small width. In Widmayer P, Neyer G, Eidenbenz S, editors, Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings. Springer Verlag. 1999. p. 148-154. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-46784-x_15

Perković, Ljubomir ; Reed, Bruce. / An improved algorithm for finding tree decompositions of small width. Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings. editor / Peter Widmayer ; Gabriele Neyer ; Stephan Eidenbenz. Springer Verlag, 1999. pp. 148-154 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4c911ebfb0194b81b1e211a5dba08dc6,

title = "An improved algorithm for finding tree decompositions of small width",

author = "Ljubomir Perkovi{\'c} and Bruce Reed",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999 ; Conference date: 17-06-1999 Through 19-06-1999",

year = "1999",

doi = "10.1007/3-540-46784-x\_15",

language = "English",

isbn = "3540667318",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "148--154",

editor = "Peter Widmayer and Gabriele Neyer and Stephan Eidenbenz",

booktitle = "Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings",

}

TY - GEN

T1 - An improved algorithm for finding tree decompositions of small width

AU - Perković, Ljubomir

AU - Reed, Bruce

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

UR - https://www.scopus.com/pages/publications/84947799712

UR - https://www.scopus.com/pages/publications/84947799712#tab=citedBy

U2 - 10.1007/3-540-46784-x_15

DO - 10.1007/3-540-46784-x_15

M3 - Conference contribution

AN - SCOPUS:84947799712

SN - 3540667318

SN - 9783540667315

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 148

EP - 154

BT - Graph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings

A2 - Widmayer, Peter

A2 - Neyer, Gabriele

A2 - Eidenbenz, Stephan

PB - Springer Verlag

T2 - 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999

Y2 - 17 June 1999 through 19 June 1999

ER -

An improved algorithm for finding tree decompositions of small width

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this