The Australian Research Data Commons (ARDC) invites you to participate in a short survey about your
interaction with the ARDC and use of our national research infrastructure and services. The survey will take
approximately 5 minutes and is anonymous. It’s open to anyone who uses our digital research infrastructure
services including Reasearch Link Australia.
We will use the information you provide to improve the national research infrastructure and services we
deliver and to report on user satisfaction to the Australian Government’s National Collaborative Research
Infrastructure Strategy (NCRIS) program.
Please take a few minutes to provide your input. The survey closes COB Friday 29 May 2026.
Complete the 5 min survey now by clicking on the link below.
New Analytical Perspectives on the Algorithmic Complexity of the Hamiltonian Cycle Problem. Hamiltonian Cycle Problem (HCP), known - in the complexity theory of
algorithms -to be NP-hard is proposed for study, from three innovative,
separate (yet related) analytical perspectives: singularly perturbed
(controlled) Markov chains, that links the HCP with systems and control
theories; parametric nonconvex optimization, that links HCP with fast
interior point methods of modern optimization an ....New Analytical Perspectives on the Algorithmic Complexity of the Hamiltonian Cycle Problem. Hamiltonian Cycle Problem (HCP), known - in the complexity theory of
algorithms -to be NP-hard is proposed for study, from three innovative,
separate (yet related) analytical perspectives: singularly perturbed
(controlled) Markov chains, that links the HCP with systems and control
theories; parametric nonconvex optimization, that links HCP with fast
interior point methods of modern optimization and the spectral approach
based on a novel adaptation of Ihara-Selberg trace formula for regular
graphs. Our mathematical approach to this archetypal complex problem of graph
theory and discrete optimization promises to enhance the fundamental
understanding - and ultimate "managibility" - of the underlying
difficulty of HCP.
Read moreRead less