[Nauty] Hard Graphs?
Gordon Royle
gordon at csse.uwa.edu.au
Mon May 19 11:20:01 EST 2003
Mark writes:
> It's interesting though, that the bipartite graphs of projective planes
> are identified in O(n^{log log n}) time. This is by far fastewr then the
> currently fastest general canonical numbering algorithm.
Sorry, but I am not sure what you mean by this... can you please elaborate?
When you say "identified", do you mean "recognized as the graph of a
projective plane" or "recognized as the graph of a *specific* projective
plane"?
Thanks
gordon
More information about the Nauty
mailing list