Skip to search formSkip to main contentSkip to account menu

Treewidth

Known as: Width (disambiguation), Tree width, Grid minor theorem 
In graph theory, the treewidth of an undirected graph is a number associated with the graph. Treewidth may be defined in several equivalent ways… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
From a theoretical viewpoint, the (tree-)decomposition methods offer a good approach for solving Constraint Satisfaction Problems… 
2012
2012
The partition function plays a key role in probabilistic modeling including conditional random fields, graphical models, and… 
2011
2011
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… 
2008
2008
In this paper we compare and illustrate the algorithmic use of graphs of bounded tree-width and graphs of bounded clique-width… 
2008
2008
We analyse classes of planar graphs with respect to various properties such as polynomial-time solvability of the dominating set… 
2006
2006
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… 
2004
2004
In recent years large amounts of electronic texts have become available. While the first of these corpora had only a low level of… 
2002
2002
LB-triang, an algorithm for computing minimal triangulations of graphs, was presented by Berry in 1999 [1], and it gave a new… 
1999
1999
This thesis is about natural language parsing with corpus-based grammars that are enriched with statistics. Parsing is the… 
1998
1998
Infinite hypergraphs with sources arise as the canonical solutions of certain systems of recursive equations written with…