306 search results - page 18 / 62 » Computing the Girth of a Planar Graph |
GC
2010
Springer
13 years 2 months ago
2010
Springer
FOCS
2009
IEEE
14 years 2 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...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...