Timeline for Long Cycle in Bounded Tree-Width Graphs using DFS and Dynamic Programming
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2014 at 21:47 | answer | added | daniello | timeline score: 1 | |
| Jun 2, 2013 at 6:41 | comment | added | Chandra Chekuri | The randomized algorithm based on color coding are quite easy to implement so you should check them out. Refs in the paper that Andreas mentioned. | |
| May 31, 2013 at 16:40 | comment | added | Jeff Wildman | Thanks for the references, I hadn't seen these before and I'll take a look. Overall, I'm trying to find the right balance between runtime and ease of understanding/implementing. | |
| May 31, 2013 at 7:19 | comment | added | Andreas Björklund | Note that by now we know much faster algorithms for finding long cycles parametrized by treewidth and pathwidth: See arxiv.org/abs/1211.1505 for deterministic algorithms (there are faster randomized ones, see references within that paper). | |
| May 31, 2013 at 2:00 | history | tweeted | twitter.com/#!/StackCSTheory/status/340286688796483586 | ||
| May 30, 2013 at 23:26 | review | First posts | |||
| May 31, 2013 at 1:30 | |||||
| May 30, 2013 at 23:08 | history | asked | Jeff Wildman | CC BY-SA 3.0 |