![]() |
|
| | |
| Craig Holman Research Jabberwocky Quotations Contact | |
| Home >
Jabberwocky      |
|
Jabberwocky for June 11, 2008 |
|
Graph Isomorphism Algorithm Timings    
On June 8, I began to discuss my Graph Isomorphism algorithm (without really saying much about it, yet) and offered some very preliminary timing data. Here is a summary of substantially more timing measurements for my graph isomorphism algorithm, implemented as a single-threaded application, running on an Intel Core 2 CPU 6400 @ 2.13 GHz with 3.25 GB of RAM. While my computer was busy with Folding@Home and letting me run a variety of programs, it was able to dedicate most of the time on one core to the graph isomorphism application. The columns specify the range of probabilities of an edge in the randomly generated graphs. The rows specify the range of the number of nodes in each graph. The determination was correct and verified in all cases. Graph Isomorphism algorithm duration in seconds to determine whether pairs of isomorphic graphs are isomorphic
    Results for 6292 pairs of isomorphic graphs
    Maximum duration
     |
| Home >
Jabberwocky      |
|
| Craig Holman Research Jabberwocky Quotations Contact | |
| Patterncraft and Constraint and Consequence are trademarks of Craig Stewart Holman Copyright © 2008 Craig Stewart Holman All Rights Reserved. |
|
| | |
![]() |
|