Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Longest Path Problem in Special Sparse Graph

Revision en1, by micah.stairs, 2016-09-20 00:28:13

Hello,

I have spent considerable time thinking about this NENA ICPC Regional problem from a few years ago and have not been able to come up with a solution: https://open.kattis.com/problems/hopper

I have also scoured the internet for an editorial or a solution and have not come up with anything (although there is one accepted solution on Kattis).

Any thoughts?

-Micah

Tags kattis, longest path, sparse graph, hamiltonian

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English micah.stairs 2016-09-20 00:28:13 427 Initial revision (published)