Skip to search formSkip to main contentSkip to account menu

Hamiltonian path

Known as: Hamiltonian cycle, Hamilton cycle, Rudrata cycle 
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
In the earlier article I introduced the notion of Hamiltonian cycle as a mathematical model for musical harmony and also proposed… 
2008
2008
We study the embedding of Hamiltonian cycle in the Crossed Cube, which is a prominent variant of the classical hypercube… 
2003
2003
For a positive integer k, a graph G is k‐ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian… 
2003
2003
We consider three distributed configuration tasks that arise in the setup and operation of multi-hop wireless networks: partition… 
Highly Cited
2001
Highly Cited
2001
The phase‐screen and the split‐step Fourier methods, which allow modeling and migration in laterally heterogeneous media, are… 
2001
2001
Designing a protection scheme for a mesh WDM network is a challenging task. Extending the concept of the SONET self-healing ring… 
2000
2000
  • J. CarleJ. Myoupo
  • 2000
  • Corpus ID: 62669601
The paper presents a convenient addressing scheme on 2D hexagonal meshes. It helps to derive simple and optimal routing and one… 
Highly Cited
1995
Highly Cited
1995
Abstract The influence of the parasitic trematode,Cryptocotylesp., on male mate choice in a species of pipefish,Syngnathus typhle… 
Highly Cited
1985