Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,728,527 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.
2014
2014
Tree-Decompositions with Connected Clusters for Solving Constraint Networks
Philippe Jégou
,
C. Terrioux
International Conference on Principles and…
2014
Corpus ID: 11491160
From a theoretical viewpoint, the (tree-)decomposition methods offer a good approach for solving Constraint Satisfaction Problems…
Expand
2012
2012
Majorization for CRFs and Latent Likelihoods
Tony Jebara
,
A. Choromańska
Neural Information Processing Systems
2012
Corpus ID: 736859
The partition function plays a key role in probabilistic modeling including conditional random fields, graphical models, and…
Expand
2011
2011
Improved Steiner Tree Algorithms for Bounded Treewidth
Markus Chimani
,
Petra Mutzel
,
Bernd Zey
International Workshop on Combinatorial…
2011
Corpus ID: 8522873
We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in O(B"t"w"+"2^[email…
Expand
2008
2008
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
Frank Gurski
arXiv.org
2008
Corpus ID: 10773346
In this paper we compare and illustrate the algorithmic use of graphs of bounded tree-width and graphs of bounded clique-width…
Expand
2008
2008
Boundary Classes of Planar Graphs
V. Lozin
Combinatorics, probability & computing
2008
Corpus ID: 34130732
We analyse classes of planar graphs with respect to various properties such as polynomial-time solvability of the dominating set…
Expand
2006
2006
The Tutte Polynomial for Matroids of Bounded Branch-Width
Petr Hliněný
Combinatorics, probability & computing
2006
Corpus ID: 18534975
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P-hard in all but a…
Expand
2004
2004
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time
Stephan Kepser
Journal of Logic, Language and Information
2004
Corpus ID: 1885889
In recent years large amounts of electronic texts have become available. While the first of these corpora had only a low level of…
Expand
2002
2002
Efficient Implementation of a Minimal Triangulation Algorithm
P. Heggernes
,
Yngve Villanger
Embedded Systems and Applications
2002
Corpus ID: 17558807
LB-triang, an algorithm for computing minimal triangulations of graphs, was presented by Berry in 1999 [1], and it gave a new…
Expand
1999
1999
Towards Probabilistic Unification-Based Parsing
ter Hugo Wilfried Laurenz Doest
1999
Corpus ID: 62161501
This thesis is about natural language parsing with corpus-based grammars that are enriched with statistics. Parsing is the…
Expand
1998
1998
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?
Klaus Barthelmann
International Symposium on Mathematical…
1998
Corpus ID: 1070223
Infinite hypergraphs with sources arise as the canonical solutions of certain systems of recursive equations written with…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE