280 search results - page 8 / 56 » Distributed Approximation Algorithms for Planar Graphs |
140
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
145
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
159
click to vote
COCOON
2005
Springer
15 years 10 months 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 ...
160
click to vote
CVPR
2010
IEEE
16 years 22 days ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
137
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...