0
$\begingroup$

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?

Improve this question
$\endgroup$
2
  • 1
    $\begingroup$ It's not clear to me what you want? Examples of graphs? $\endgroup$
    – Chris Godsil
    Commented Apr 29, 2012 at 13:04
  • $\begingroup$ Yes. Grid graphs with wholes.. I reckon I can do my own but I would like to find sources with known solutions. $\endgroup$
    – darryl
    Commented Apr 30, 2012 at 10:44

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .