The parametrized complexity of knot polynomials

Journal of Computer and System Sciences

Volumn 67, Issue 4, 2003, Pages 742-756

  Makowsky, J A ^a   Marino J P ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSIDAD DE LOS ANDES   (Colombia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

JONES POLYNOMIALS; KAUFFMAN POLYNOMIALS; TUTTE POLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

EID: 0347527401     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00080-1     Document Type: Article

References (40)

1. S. Arnborg, D.G. Corneil, A. Proskurowski, Complexity of finding embedding in a k-tree, SIAM J. Algebraic Discrete Methods 8 (1987) 277-284.
2. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
3. H. Bodlaender, Treewidth: algorithmic techniques and results, Proceedings of the 22th International Symposium on the Mathematical Foundation of Computer Science, MFCS'97, Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin, 1997, pp. 29-36.
4. H. Bodlaender, T. Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms 21 (1996) 358-402.
5. B. Bollobás, Modern Graph Theory, Springer, Berlin, 1999.
6. G. Burde, H. Zieschang, Knots, in: Studies in Mathematics, Vol. 5, de Gruyter, Berlin, 1985.
7. J.H. Conway, An enumeration of knots and links, in: J. Leech (Ed.), Computational Problems in Abstract Algebra, Pergamon Press, Oxford, 1969, pp. 329-358.
8. B. Courcelle, Graph rewriting: an algebraic approach in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. 2, Elsevier, Amsterdam, 1990 (Chapter 5).
9. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 1: Foundations, World Scientific, Singapore, 1997, pp. 313-400 (Chapter 5).
10. B. Courcelle, J. Engelfriet, G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993) 218-270.
11. B. Courcelle, J.A. Makowsky, Fusion on relational structures and the verification of monadic second order properties, Mathematical Struct. Comput. Science 12 (2002) 203-235.
12. B. Courcelle, J.A. Makowsky, U. Rotics, On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic, Discrete Appl. Math. 108 (1-2) (2001) 23-52.
13. R. Diestel, Graph Theory, Graduate Texts in Mathematics, Springer, Berlin, 1996.
14. R.G. Downey, M.F. Fellows, Parametrized Complexity, Springer, Berlin, 1999.
15. P. Freyd, D. Yetter, J. Hoste, W.B.R. Lickorish, K.C. Millet, A. Ocneanu, A new polynomial invariant of knots and links, Bull. Amer. Math. Soc. 12 (1985) 239-246.
16. C. Godsil, G. Royle, Algebraic Graph Theory, Graduate Texts in Mathematics, Springer, Berlin, 2001.
17. J. Haas, J.C. Lagarias, N. Pippenger, The computational complexity of knot and link problems, J. ACM 46.2 (1999) 185-211.
18. L.H. Kauffman, A Tutte polynomial for signed graphs, Discrete Appl. Math. 25 (1989) 105-127.
19. L.H. Kauffman, An invariant for regular isotopy, Trans. Amer. Math. Soc. 318 (1990) 417-471.
20. L.H. Kauffman, Knots and Physics, World Scientific, Singapore, 1991.
21. L.H. Kauffman (Ed.), Knots and Applications, World Scientific, Singapore, 1995.
22. L.H. Kauffman, Preface, in: L.H. Kauffman (Ed.), Knots and Applications, World Scientific, Singapore, 1995, pp. 9-36.
23. W.B.R. Lickorish, Introduction to Knot Theory, Graduate Texts in Mathematics, Springer, Berlin, 1997.
24. J.A. Makowsky, Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width, in: Discrete Applied Mathematics, to appear in 2003. 2003. Extended abstract published in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'01, Washington D.C., ACM and SIAM, 2001, pp. 487-495.
25. J.A. Makowsky, J.P. Mariño, Farrell polynomials on graphs of bounded tree width, Presented at FPSAC'01, 2000.
26. J.A. Makowsky, J.P. Mariño, Farrell polynomials on graphs of bounded treewidth, Adv. Appl. Math. 30 (2003) 160-176.
27. J. Mighton, Knot theory on bipartite graphs, Ph.D. Thesis, Department of Mathematics, University of Toronto, Toronto, Canada, 1999.
28. H.R. Morton, H.B. Short, Calculating the 2-variable polynomial for knots presented as closed braids, J. Algorithms 11 (1990) 117-131.
29. H.R. Morton, P. Traczyk, Knots and algebras, in: E. Martin-Peinador, A. Rodez Usan (Eds.), Contribuciones Metematicas en homenaje al profesor D. Antonio Plans Sanz de Bremond, University of Zaragoza, Zaragoza, 1990, pp. 201-220.
30. H.R. Morton, A.J. Wassermann, A basis for the Birman-Wenzl algebra, Preprint 1989, updated January 2000, http://www.liv.ac.uk/~sul4/knotprints.html.
31. K. Murasugi, Knot Theory and its Applications, Birkhäuser, Basel, 1996.
32. V.V. Prasolov, A.B. Sossinsky, Knots, Links, Braids and 3-Manifolds, Translations of Mathematical Monographs, Vo. 154, Amer. Math. Soc., Providence, RI, 1997.
33. J. Przytycki, Classical roots of knot theory, Chaos, Solitons Fractals 9 (4-5) (1998) 531-545.
34. J. Przytycki, private communication, Washington, January 2001.
35. J. Przytycki, P. Traczyk, Invariants of Conway type, Kobe J. Math. 4 (1987) 115-139.
36. J. Przytycki, T. Tsukamoto, The fourth skein module and the Montesinos-Nakanishi conjecture for 3-algebraic links, J. Knot Theory Ramifications 10 (7) (2001) 959-982.
37. N. Robertson, P.D. Seymour, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995) 65-110.
38. A. Sossinsky, Noeuds: Genèse d'une théorie mathématique, Seuil, Paris, 1999.
39. P. Vogel, Representations of links by braids: a new algorithm, Comment. Math. Helv. 65 (1990) 104-113.
40. D.J.A. Welsh, Complexity: Knots, Colourings and Counting, in: London Mathematical Society Lecture Notes Series, Vol. 186, Cambridge University Press, Cambridge, 1993.