Sbrodova, Elena An algorithm of finding planar surfaces in three-manifolds. (English) Zbl 1150.57304 Sib. Èlektron. Mat. Izv. 2, 192-193 (2005). From the introduction: The paper is devoted to the question: does there exist an algorithm to decide whether or not a given 3-manifold contains a proper essential planar surface? In 1998, W. Jaco, H. Rubinstein, and E. Sedgwick described an algorithm to decide whether or not a given link-manifold contains a proper essential planar surface (a link-manifold is a compact orientable 3-manifold whose boundary consists of tori). We generalize this result to manifolds with arbitrary boundaries. MSC: 57M25 Knots and links in the \(3\)-sphere (MSC2010) 57N10 Topology of general \(3\)-manifolds (MSC2010) Keywords:algoritmic topology; classification of 3-manifolds; decision problem; space of Dehn fillings PDFBibTeX XMLCite \textit{E. Sbrodova}, Sib. Èlektron. Mat. Izv. 2, 192--193 (2005; Zbl 1150.57304) Full Text: EuDML