110 search results - page 4 / 22 » A degree bound on decomposable trees |
APBC
2007
13 years 10 months ago
2007
IPCO
1996
13 years 9 months ago
1996
ALGORITHMICA
2010
13 years 8 months ago
2010
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
WG
2005
Springer
14 years 1 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...