Timeline for Toroidality testing
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2023 at 2:06 | comment | added | Licheng Zhang | See also codegolf.stackexchange.com/questions/140514/… | |
| Aug 21, 2016 at 3:29 | vote | accept | Felix Goldberg | ||
| S Aug 19, 2016 at 5:10 | history | suggested | Mike Pierce | CC BY-SA 3.0 |
Changed some wording to clean it up and added a link to the C++ Boost implementation
|
| Aug 19, 2016 at 4:53 | review | Suggested edits | |||
| S Aug 19, 2016 at 5:10 | |||||
| Aug 19, 2016 at 4:51 | answer | added | Mike Pierce | timeline score: 4 | |
| Jan 21, 2013 at 22:45 | comment | added | Gerry Myerson | Perhaps there is something in E. Neufeld, W. Myrvold, Practical toroidality testing, in: 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997, pp. 574–580. Another reference is J. Chambers, Hunting for torus obstructions, M.Sc. Thesis, Department of Computer Science, University of Victoria, 2002 --- I don't know whether that has been published. | |
| Jan 21, 2013 at 22:38 | comment | added | Felix Goldberg | @FeldmannDenis: Can you give me a reference, please? Although I do think I'd rather use some other method... :) | |
| Jan 21, 2013 at 21:14 | comment | added | Feldmann Denis | Well, you can check if they dont have as minor one of the 16000 already known obstructions (for not too large graphs, this is less absurd than it sounds...) | |
| Jan 21, 2013 at 17:22 | history | asked | Felix Goldberg | CC BY-SA 3.0 |