A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
From MaRDI portal
Publication:1708538
DOI10.1007/s10479-017-2571-7zbMath1384.90083arXiv1902.10356OpenAlexW2725940998MaRDI QIDQ1708538
John F. Roddick, Michael Haythorpe, Jerzy A. Filar, Vladimir V. Ežov, Serguei Rossomakhine
Publication date: 23 March 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.10356
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Uniquely Hamiltonian Graphs of Minimum Degree 4
- An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Algorithms and Data Structures
- Graphs and matrices
- Graph Sparsification by Effective Resistances
This page was built for publication: A note on using the resistance-distance matrix to solve Hamiltonian cycle problem