Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
21
views
31
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,891
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Mathematical Foundations of Computer Science 2001
Hypertree Decompositions: A Survey
other
Author(s):
Georg Gottlob
,
Nicola Leone
,
Francesco Scarcello
Publication date
(Online):
September 5 2001
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Language Documentation and Conservation
Most cited references
31
Record
: found
Abstract
: not found
Article
: not found
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Hans L. Bodlaender
(1996)
0
comments
Cited
248
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
The complexity of satisfiability problems
Thomas Schaefer
(1978)
0
comments
Cited
235
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Graph minors. II. Algorithmic aspects of tree-width
Neil Robertson
,
P.D Seymour
(1986)
0
comments
Cited
217
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
September 5 2001
Pages
: 37-57
DOI:
10.1007/3-540-44683-4_5
SO-VID:
44b4c5fd-d262-488e-9f67-da692489e272
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 18
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
pp. 37
Hypertree Decompositions: A Survey
pp. 111
Refined Search Tree Technique for Dominating Set on Planar Graphs
Similar content
1,891
Bounds on the Number of Edges Bound on the Number of Edges of Edge-minimal, Edge-maximal and \(l\)-hypertrees
Authors:
Counting complements in the partition lattice, and hypertrees
Authors:
Daniel Grieser
Ordered h-hypertrees
Authors:
Ioan Tomescu
See all similar
Cited by
9
A Combinatorial Approach to Nonlocality and Contextuality
Authors:
Antonio Acin
,
Tobias Fritz
,
Anthony Leverrier
…
A Combinatorial Approach to Nonlocality and Contextuality
Authors:
,
,
…
Taming the Infinite Chase: Query Answering under Expressive Integrity Constraints
Authors:
Georg Gottlob
,
Andrea Cali
,
Michael Kifer
See all cited by