Timeline for Recognition of graph families.
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2011 at 22:02 | comment | added | Tony Huynh | The original algorithm of Robertson and Seymour ran in cubic time, but it has since been improved to quadratic by Kawarabayashi, Kobayashi and Reed. See research.nii.ac.jp/~k_keniti/quaddp1.pdf | |
| Dec 12, 2011 at 20:41 | comment | added | Joseph O'Rourke | @Will: Yes, cubic in the size of the graph, but with a constant superpolynomial in the minor size. | |
| Dec 12, 2011 at 20:35 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
URL problem...
|
| Dec 12, 2011 at 19:45 | comment | added | Will Sawin | Cubic time, in fact, if I remember correctly. | |
| Dec 12, 2011 at 17:19 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |