Re:A Quasipolynomial Time Algorithm for Graph Isomorphism: T...
by bmm6o on Thursday November 12, 2015 @04:38PM
(#10556335)
In your hypothetical case the vertices would be labeled by friends' names or ids. So you only have to check whether the obvious isomorphism applies i.e. that the graphs are equivalent as sets.
[ Parent
| on HN ]
Re:A Quasipolynomial Time Algorithm for Graph Isomorphism: T...
by OJFord on Thursday November 12, 2015 @09:32PM
(#10557679)
Ah, yes that's true of course - I clearly wasn't thinking..
Well, then I can't even contrive an example! Still, it's interesting; I wish I had the background to understand it better.