Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
bounded treewidth
Description:
A graph-structural property in which a graph’s treewidth is limited by a fixed bound, often enabling efficient algorithms.
Primary topic:
Advanced Graph Theory Research (58%)
Related topics:
Advanced Graph Theory Research (58%),
Complexity and Algorithms in Graphs (18%)
OpenAlex ID:
keywords/bounded-treewidth
A partial k-arboretum of graphs with bounded treewidth
1998
·
Hans L. Bodlaender
·
Theoretical Computer Science
·
1,415
Easy problems for tree-decomposable graphs
1991
·
Stefan Arnborg
, Jens Lagergren
, et al.
·
Journal of Algorithms
·
1,040
Quickly Excluding a Planar Graph
1994
·
N. Robertson
, P. Seymour
, et al.
·
Journal of Combinatorial Theory Series B
·
527
Hypertree Decompositions and Tractable Queries
2002
·
Georg Gottlob
, Nicola Leone
, et al.
·
Journal of Computer and System Sciences
·
492
Computing correlated equilibria in multi-player games
2008
·
Christos H. Papadimitriou
, Tim Roughgarden
·
Journal of the ACM
·
411
Combinatorial Optimization on Graphs of Bounded Treewidth
2007
·
H. L. Bodlaender
, A. M. C. A. Koster
·
The Computer Journal
·
354
Treewidth: Algorithmic techniques and results
1997
·
Hans L. Bodlaender
·
Lecture notes in computer science
·
339
Algorithmic Meta-theorems for Restrictions of Treewidth
2011
·
Michael Lampis
·
Algorithmica
·
300
Deciding first-order properties of locally tree-decomposable structures
2001
·
Markus Frick
, Martin Grohe
·
Journal of the ACM
·
276
PDF
Two strikes against perfect phylogeny
1992
·
Hans L. Bodlaender
, Mike R. Fellows
, et al.
·
Lecture notes in computer science
·
238
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
2002
·
Víctor Dalmau
, Phokion G. Kolaitis
, et al.
·
Lecture notes in computer science
·
206
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
2000
·
Daniele Frigioni
, Alberto Marchetti-Spaccamela
, et al.
·
Journal of Algorithms
·
201
Precoloring extension. I. Interval graphs
1992
·
M. Biró
, M. Hujter
, et al.
·
Discrete Mathematics
·
196
Computational properties of argument systems satisfying graph-theoretic constraints
2007
·
Paul E. Dunne
·
Artificial Intelligence
·
181
The Knapsack Problem with Conflict Graphs
2009
·
Ulrich Pferschy
, Joachim Schauer
·
Journal of Graph Algorithms and Applications
·
177
Edge dominating set and colorings on graphs with fixed clique-width
2002
·
Daniel Kobler
, Udi Rotics
·
Discrete Applied Mathematics
·
175
PDF
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
1998
·
Hans L. Bodlaender
, Torben Hagerup
·
SIAM Journal on Computing
·
165
Testing first-order properties for subclasses of sparse graphs
2013
·
Zdeněk Dvořák
, Daniel Král
, et al.
·
Journal of the ACM
·
149
PDF
Star coloring of graphs
2004
·
Guillaume Fertin
, André Raspaud
, et al.
·
Journal of Graph Theory
·
148
On recognizing graphs by numbers of homomorphisms
2010
·
Zdeněk Dvořák
·
Journal of Graph Theory
·
143
The Tree Width of Separation Logic with Recursive Definitions
2013
·
Radu Iosif
, Adam Rogalewicz
, et al.
·
Lecture notes in computer science
·
142
Logic, Graphs, and Algorithms
2007
·
Martin Grohe
·
133
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
2006
·
Leizhen Cai
, Siu Man Chan
, et al.
·
Lecture notes in computer science
·
131
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
2011
·
Mohammadhossein Bateni
, Mohammadtaghi Hajiaghayi
, et al.
·
Journal of the ACM
·
125
PDF
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms
2005
·
Fedor V. Fomin
, Fabrizio Grandoni
, et al.
·
Bulletin of the European Association for Theoretical Computer Science
·
124
Show more works
View as search
Works count:
865
Citation count:
18,660
Year
Topic
Type