On testing Hamiltonicity of graphs
From MaRDI portal
Publication:468434
DOI10.1016/j.disc.2014.08.021zbMath1302.05098OpenAlexW2076086942MaRDI QIDQ468434
Publication date: 7 November 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.021
Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cites Work
- The complexity of computing the permanent
- On the complexity of nonnegative-matrix scaling
- The maximum number of Hamiltonian paths in tournaments
- TSP with bounded metrics
- An approximation algorithm for counting contingency tables
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Computing the Partition Function for Perfect Matchings in a Hypergraph
- Property testing and its connection to learning and approximation
- The Traveling Salesman Problem with Distances One and Two
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
