Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,055,277 papers from all fields of science
Search
Sign In
Create Free Account
Treewidth
Known as:
Width (disambiguation)
, Tree width
, Grid minor theorem
Expand
In graph theory, the treewidth of an undirected graph is a number associated with the graph. Treewidth may be defined in several equivalent ways…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Bramble (graph theory)
Branch-decomposition
Cactus graph
Caterpillar tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
D S ] 2 A pr 2 01 9 Oriented coloring on recursively defined digraphs
Frank Gurski
,
Dominique Komander
,
Carolin Rehs
2019
Corpus ID: 102513899
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied…
Expand
2015
2015
Excluding A Grid Minor In Planar Digraphs
Thor Johnson
,
N. Robertson
,
P. Seymour
,
R. Thomas
arXiv.org
2015
Corpus ID: 7420105
In [Directed tree-width, J. Combin. Theory Ser. B 82 (2001), 138-154] we introduced the notion of tree-width of directed graphs…
Expand
2009
2009
Exact methods for finding the tree-width of graphs
C.P.M. van Hoesel
,
A. Berger
,
A. Grigoriev
,
J. Ensinck
2009
Corpus ID: 125349513
2008
2008
On the Compilation of Programs into their Equivalent Constraint Representation
F. Wotawa
,
M. Nica
Informatica
2008
Corpus ID: 17259834
In this paper we introduce the basic methodology for analyzing and debugging programs. We first convert programs into their loop…
Expand
2005
2005
RECOGNIZABILITY EQUALS DEFIXIBILITY FOR PARTIAL I<-PATHS
Simon Fraser
2005
Corpus ID: 13841285
It is well-known that a language is recognizable iff it is definable in a monadic second-ordcs logic. The same holds for sets of…
Expand
2003
2003
Infinite graphs generated by tree rewriting
Christof Löding
,
W. Thomas
,
E. Grädel
2003
Corpus ID: 124000641
2003
2003
Lower Bounds for Oblivious Single-Packet End-to-End Communication
P. Fraigniaud
,
C. Gavoille
International Symposium on Distributed Computing
2003
Corpus ID: 8993471
The end-to-end communication problem is a protocol design problem, for sending a packet from a specified source-node s to a…
Expand
2003
2003
The building blocks of complexity: a unified criterion and selected applications in risk management
D. Seese
,
F. Schlottmann
2003
Corpus ID: 16308729
The analysis of many complex problems and complex dynamic systems suggests that there are dependencies between high complexity…
Expand
Review
1999
Review
1999
A note on CSP graph parameters
T. Schiex
1999
Corpus ID: 18673243
Several graph parameters such as induced width, minimum maximum clique size of a chordal completion, k-tree number, bandwidth…
Expand
1996
1996
HOW TO CONSTRUCT A HYPEREDGE REPLACEMENT SYSTEM FOR A CONTEXT-FREE SET OF HYPERGRAPHS
Klaus Barthelmann
1996
Corpus ID: 17806919
We give yet another proof for the fact that a context-free set of simple hypergraphs can be generated by hyperedge replacement if…
Expand