Timeline for Checking existence of a non-crossing Hamiltonian path in geometric graphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2023 at 4:35 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
prefer this spelling
|
| Apr 13, 2023 at 4:28 | history | edited | Pritam Majumder |
edited tags
|
|
| Apr 12, 2023 at 20:59 | history | edited | Pritam Majumder | CC BY-SA 4.0 |
added 4 characters in body
|
| Apr 12, 2023 at 20:05 | comment | added | Joseph O'Rourke | This quite recent paper may help: Eppstein, David. "Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time." arXiv:2303.00147 (2023). | |
| Apr 12, 2023 at 19:34 | history | asked | Pritam Majumder | CC BY-SA 4.0 |