A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank

zbMath1403.05080arXiv1709.02311MaRDI QIDQ4607957

Jesper Nederlof, Radu Curticapean, Nathan Lindzey

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1709.02311

zbMATH Keywords

randomized algorithmHamiltonicitypathwidthmatrix rankperfect matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Randomized algorithms (68W20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices ⋮ Unnamed Item ⋮ Clifford algebras meet tree decompositions

This page was built for publication: A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank