Results 1 
5 of
5
Subgraph Isomorphism in Planar Graphs and Related Problems
, 1999
"... We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small treewidth, and applying dynamic programming within each piece. The same methods can be used to ..."
Abstract

Cited by 108 (3 self)
 Add to MetaCart
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small treewidth, and applying dynamic programming within each piece. The same methods can be used to solve other planar graph problems including connectivity, diameter, girth, induced subgraph isomorphism, and shortest paths.
Diameter and Treewidth in MinorClosed Graph Families
, 1999
"... It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show that treewidth is bounded by a function of the diameter in a ..."
Abstract

Cited by 82 (3 self)
 Add to MetaCart
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show that treewidth is bounded by a function of the diameter in a minorclosed family, if and only if some apex graph does not belong to the family. In particular, the O(D) bound above can be extended to boundedgenus graphs. As a consequence, we extend several approximation algorithms and exact subgraph isomorphism algorithms from planar graphs to other graph families.
The computational Complexity of Knot and Link Problems
 J. ACM
, 1999
"... We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without selfintersection so that it lies in a plane. We show that this problem, unknotting problem is in NP. We also consider the problem, unknotting pr ..."
Abstract

Cited by 55 (6 self)
 Add to MetaCart
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without selfintersection so that it lies in a plane. We show that this problem, unknotting problem is in NP. We also consider the problem, unknotting problem of determining whether two or more such polygons can be split, or continuously deformed without selfintersection so that they occupy both sides of a plane without intersecting it. We show that it also is in NP. Finally, we show that the problem of determining the genus of a polygonal knot (a generalization of the problem of determining whether it is unknotted) is in PSPACE. We also give exponential worstcase running time bounds for deterministic algorithms to solve each of these problems. These algorithms are based on the use of normal surfaces and decision procedures due to W. Haken, with recent extensions by W. Jaco and J. L. Tollefson.
The number of Reidemeister Moves Needed for Unknotting
, 2008
"... There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequence of at most 2 c1n Reidemeister moves that will convert it to a trivial knot diagram, where n is the number of crossings in D. A similar result holds for elementary moves on a polygonal knot K embe ..."
Abstract

Cited by 35 (11 self)
 Add to MetaCart
There is a positive constant c1 such that for any diagram D representing the unknot, there is a sequence of at most 2 c1n Reidemeister moves that will convert it to a trivial knot diagram, where n is the number of crossings in D. A similar result holds for elementary moves on a polygonal knot K embedded in the 1skeleton of the interior of a compact, orientable, triangulated PL 3manifold M. There is a positive constant c2 such that for each t ≥ 1, if M consists of t tetrahedra, and K is unknotted, then there is a sequence of at most 2 c2t elementary moves in M which transforms K to a triangle contained inside one tetrahedron of M. We obtain explicit values for c1 and c2.
The size of spanning disks for polygonal knots
, 1999
"... For each integer n ≥ 1 we construct a closed unknotted Piecewise Linear curve Kn in R 3 having less than 11n edges with the property that any Piecewise Linear triangluated disk spanning the curve contains at least 2 n−1 triangles. 1 Introduction. We show the existence of a sequence of unknotted simp ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
For each integer n ≥ 1 we construct a closed unknotted Piecewise Linear curve Kn in R 3 having less than 11n edges with the property that any Piecewise Linear triangluated disk spanning the curve contains at least 2 n−1 triangles. 1 Introduction. We show the existence of a sequence of unknotted simple closed curves Kn in R 3 having the following properties: • The curve Kn is a polygon with at most 11n edges. • Any Piecewise Linear (PL) embedding of a triangulated disk into R 3 with