Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms 2017
DOI: 10.1137/1.9781611974782.178
|View full text |Cite
|
Sign up to set email alerts
|

Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold

Abstract: We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly nonsimple) closed curve on the boundary of M , decide whether this curve is contractible in M . Our algorithm is combinatorial and runs in exponential time. This is the first algorithm that is specifically designed for this problem; its running time considerably improves upon the existing bounds implicit in the literature for the more general problem of contractibility of closed curves in a 3-manifold. The proo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 29 publications
0
0
0
Order By: Relevance