112 search results - page 1 / 23 » Constant factor approximation of vertex-cuts in planar graph... |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
WDAG
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
FAW
2009
Springer
13 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 ...