Knot Diagrams of Treewidth Two

H.L. Bodlaender; Benjamin Burton; Fedor Fomin; Alexander Grigoriev

Knot Diagrams of Treewidth Two

H.L. Bodlaender, Benjamin Burton, Fedor Fomin, Alexander Grigoriev

Research output: Book/Report › Report › Academic

Abstract

In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a link diagram of treewidth two we can test in linear time if it represents the unlink. From the algorithm, it follows that a diagram of the unknot of treewidth 2 can always be reduced to the trivial diagram with at most n (un)twist and (un)poke Reidemeister moves.

Original language	English
Place of Publication	Cornell University Library, US
Publisher	arXiv.org at Cornell University Library
Number of pages	19
Volume	1904.03117v2
Publication status	Published - 8 Apr 2019

Publication series

Series	cs.DS

JEL classifications

c00 - Mathematical and Quantitative Methods: General

Access to Document

https://arxiv.org/abs/1904.03117

Cite this

@book{753d324e1aa0431388e16549066ba298,

title = "Knot Diagrams of Treewidth Two",

abstract = "In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a link diagram of treewidth two we can test in linear time if it represents the unlink. From the algorithm, it follows that a diagram of the unknot of treewidth 2 can always be reduced to the trivial diagram with at most n (un)twist and (un)poke Reidemeister moves.",

author = "H.L. Bodlaender and Benjamin Burton and Fedor Fomin and Alexander Grigoriev",

note = "data source: NO DATA USED",

year = "2019",

month = apr,

day = "8",

language = "English",

volume = "1904.03117v2",

series = "cs.DS",

publisher = "arXiv.org at Cornell University Library",

}

TY - BOOK

T1 - Knot Diagrams of Treewidth Two

AU - Bodlaender, H.L.

AU - Burton, Benjamin

AU - Fomin, Fedor

AU - Grigoriev, Alexander

N1 - data source: NO DATA USED

PY - 2019/4/8

Y1 - 2019/4/8

N2 - In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a link diagram of treewidth two we can test in linear time if it represents the unlink. From the algorithm, it follows that a diagram of the unknot of treewidth 2 can always be reduced to the trivial diagram with at most n (un)twist and (un)poke Reidemeister moves.

AB - In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a link diagram of treewidth two we can test in linear time if it represents the unlink. From the algorithm, it follows that a diagram of the unknot of treewidth 2 can always be reduced to the trivial diagram with at most n (un)twist and (un)poke Reidemeister moves.

M3 - Report

VL - 1904.03117v2

T3 - cs.DS

BT - Knot Diagrams of Treewidth Two

PB - arXiv.org at Cornell University Library

CY - Cornell University Library, US

ER -