Timeline for Algorithm to determine isomorphism of 2 maximal planar graphs
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11, 2015 at 14:00 | comment | added | Willy Van den Driessche | Hello, tx for the reply. My interest is practical. I want to implement a computer program that checks the isomorphism of two planar graphs. I am currently using a general purpose library for this but it is "slow" (rather "too" slow). My idea was to profit from the case I have a planar graph and speed this up. Since I build up sets of graphs, having a "signature" would greatly reduce the number of graphs I have to "compare" with. I currently use the edgecountlist but the buckets get too big for larger vertexcounts. I will look into your suggestions. | |
| Sep 4, 2015 at 23:50 | history | answered | Brendan McKay | CC BY-SA 3.0 |