Login / Signup

The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.

John J. Bartholdi IIIPaul Goldsman
Published in: Oper. Res. Lett. (2004)
Keyphrases
  • hamiltonian cycle
  • traveling salesman problem
  • graph coloring
  • phase transition
  • reinforcement learning
  • job shop scheduling
  • strongly connected
  • directed graph