20 search results - page 1 / 4 » On the Minimum Augmentation of an l-Connected Graph to a k-C... |
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
ICC
2009
IEEE
13 years 11 months ago
2009
IEEE
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
COMGEO
2008
ACM
13 years 4 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....