Website
http://dataportal.arc.gov.au/NCGP/API/grants/DP0343028
Funding Status
Closed
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Funded Activity Summary
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.Funded Activity Details
Start Date: 2003
End Date: 12-2005
Funding Scheme: Discovery Projects
Funding Amount: $172,536.00
Funder: Australian Research Council
Research Topics
ANZSRC Field of Research (FoR)
Analysis Of Algorithms And Complexity | Numerical and Computational Mathematics | Optimisation | Group Theory And Generalisations (Incl. Topological Groups And Lie
ANZSRC Socio-Economic Objective (SEO)
Combined operations | Computer software and services not elsewhere classified | Transport |
