400 search results - page 1 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
ICALP
1995
Springer
13 years 9 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
EVOW
2009
Springer
14 years 1 months ago
2009
Springer
Motivated by parallel optimization, we experiment EDA-like adaptation-rules in the case of λ large. The rule we use, essentially based on estimation of multivariate normal algorit...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
SWAT
1994
Springer
13 years 10 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...