MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).
0

I understand that there is a polynomial algorithm to solve TSPs that are in solid grid graph form (grid graphs without holes).

I am particularly interested in the non-solid grid graph form of the HCP / TSP problems. In other words, I would like to find some instances of the grid graphs that are non-solid.

Googling is to no avail. Does anyone know of a good resource?

flag
1 
 It's not clear to me what you want? Examples of graphs? – Chris Godsil Apr 29 2012 at 13:04
Yes. Grid graphs with wholes.. I reckon I can do my own but I would like to find sources with known solutions. – darryl Apr 30 2012 at 10:44

Your Answer

Get an OpenID
or

Browse other questions tagged or ask your own question.