Determinant Sums for Hamiltonicity (Invited Talk)

Author Andreas Björklund

Thumbnail PDF


  • Filesize: 200 kB
  • 1 pages

Document Identifiers

Author Details

Andreas Björklund

Cite AsGet BibTex

Andreas Björklund. Determinant Sums for Hamiltonicity (Invited Talk). In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


The best worst case guarantee algorithm to see if a graph has a Hamiltonian cycle, a closed tour visiting every vertex exactly once, for a long time was based on dynamic programming over all the vertex subsets of the graph. In this talk we will show some algebraic techniques that can be used to see if a graph has a Hamiltonian cycle much faster. These techniques utilize sums over determinants of matrices. In particular we will show how you can find out if an undirected graph has a Hamiltonian cycle much faster, but we will also talk about some partial results for the directed case and modular counting.
  • Hamiltonian cycle
  • exact algorithms
  • matrix determinant
  • algebraic techniques


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads