7129 search results - page 4 / 1426 » Approximation Algorithms for Treewidth |
COCOON
2005
Springer
14 years 27 days ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
APPROX
2004
Springer
14 years 23 days ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
SIGECOM
2009
ACM
14 years 1 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
SIAMCOMP
2008
13 years 7 months ago
2008
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
UAI
2008
13 years 8 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...