23 search results - page 1 / 5 » Degree-Based Treewidth Lower Bounds |
WEA
2005
Springer
14 years 4 months ago
2005
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
UAI
2004
14 years 7 days ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
AAIM
2006
Springer
14 years 4 months ago
2006
Springer
