You Can't Get There from Here—an Algorithmic Approach to Eulerian and Hamiltonian Circuits
Keyword(s):
Suppose you are in charge of the routing for a road crew whose job is to paint yellow lines down the center of all highways in a given section of the country. Your first task is to organize their travels to find a route that takes the crew over each section of the highway exactly once and returns them to their starting point. Such a route is an Eulerian circuit. Now suppose that the towns being served by these highways will pay the workers only on completion of the entire job. Your second task is to find a route that will take them through each town exactly once, again returning them to their starting point. This kind of route is a Hamiltonian circuit.
Keyword(s):
1982 ◽
Vol 24
(2)
◽
pp. 234-242
◽
Keyword(s):
2019 ◽
Vol 8
(12)
◽
pp. 4843-4846
2017 ◽
Vol 12
(4)
◽
Keyword(s):
1984 ◽
Vol 42
◽
pp. 428-429
Keyword(s):
2020 ◽
Vol 5
(5)
◽
pp. 1175-1187
Keyword(s):
2006 ◽
Vol 37
(3)
◽
pp. 131-139
◽
2005 ◽
Vol 36
(3)
◽
pp. 103-115
◽
Keyword(s):
Keyword(s):