Timeline for Graph minor check
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 12, 2012 at 13:25 | comment | added | Timothy Chow | In case it wasn't clear, this is the algorithm that is implemented in the Sage code that I mentioned in my answer. | |
| Jul 12, 2012 at 7:09 | comment | added | Igor Rivin | @gordon-royle: no argument from me... Is there a reasonable description of "practical" heuristics somewhere? | |
| Jul 11, 2012 at 23:40 | comment | added | Gordon Royle | And the constants in the algorithm are astronomical powers of 2 | |
| Jul 11, 2012 at 23:17 | comment | added | Henry Cohn | Just to be clear: this algorithm runs in polynomial time for a fixed minor, but not if you let that vary. | |
| Jul 11, 2012 at 22:28 | history | answered | Igor Rivin | CC BY-SA 3.0 |