112 search results - page 13 / 23 » Constant factor approximation of vertex-cuts in planar graph... |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
SWAT
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
DISOPT
2010
13 years 8 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...