Determinant Sums for Undirected Hamiltonicity
From MaRDI portal
Publication:5419040
DOI10.1137/110839229zbMath1292.05244arXiv1008.0541OpenAlexW2120141762MaRDI QIDQ5419040
Publication date: 4 June 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.0541
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (33)
Spotting Trees with Few Leaves ⋮ The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems ⋮ Spotting Trees with Few Leaves ⋮ On the Equivalence among Problems of Bounded Width ⋮ Randomized parameterized algorithms for the kidney exchange problem ⋮ Narrow sieves for parameterized paths and packings ⋮ A multivariate framework for weighted FPT algorithms ⋮ Exact Algorithms for the Minimum Load Spanning Tree Problem ⋮ End-Vertices of Graph Search Algorithms ⋮ Exact algorithms for finding longest cycles in claw-free graphs ⋮ Unnamed Item ⋮ A Hopf algebra for counting cycles ⋮ Revisiting the parameterized complexity of maximum-duo preservation string mapping ⋮ Path Contraction Faster than $2^n$ ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials ⋮ The Asymmetric Travelling Salesman Problem In Sparse Digraphs. ⋮ Finding tight Hamilton cycles in random hypergraphs faster ⋮ Detecting and Counting Small Pattern Graphs ⋮ Algebraic methods in the congested clique ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast exact algorithms for survivable network design with uniform requirements ⋮ Path Contraction Faster Than 2^n ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space ⋮ Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors ⋮ Finding Hamiltonian Cycle in Graphs of Bounded Treewidth ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ Unnamed Item ⋮ Shortest Two Disjoint Paths in Polynomial Time ⋮ Moderate exponential-time algorithms for scheduling problems ⋮ Unnamed Item
This page was built for publication: Determinant Sums for Undirected Hamiltonicity
