A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
- 28 June 2017
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 261 (1-2) , 393-399
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Australian Research Council (LP110100166, DP150100618)
This publication has 17 references indexed in Scilit:
- An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least threeRandom Structures & Algorithms, 2014
- Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problemMathematical Programming Computation, 2013
- Uniquely Hamiltonian Graphs of Minimum Degree 4Journal of Graph Theory, 2013
- Investigation of the role of similarity measure and ranking algorithm in mining social networksJournal of Information Science, 2011
- Graph Sparsification by Effective ResistancesSIAM Journal on Computing, 2011
- Circuit theory predicts gene flow in plant and animal populationsProceedings of the National Academy of Sciences, 2007
- Resistance‐distance matrix: A computational algorithm and its applicationInternational Journal of Quantum Chemistry, 2001
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Resistance distanceJournal of Mathematical Chemistry, 1993
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait ColorableThe American Mathematical Monthly, 1975