scientific article; zbMATH DE number 475581

zbMath0792.05058MaRDI QIDQ4273837

Dominic J. A. Welsh

Publication date: 6 January 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

knotbraidscomplexity of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Braid groups; Artin groups (20F36) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Complexity of circuit intersection in graphs, Finding geometric representations of apex graphs is NP-hard, The number of Reidemeister moves needed for unknotting, The computational complexity of knot genus and spanning area