Timeline for Where is it shown how to construct a decomposition tree for a series-parallel graph in linear time?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 22, 2010 at 16:49 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 15 characters in body
|
| Jul 22, 2010 at 13:09 | comment | added | András Salamon | Unfortunately the generic algorithm for bounded treewidth has a huge constant, depending on the tree automaton. I'm fairly convinced that a direct approach, such as the reference linear time algorithm for modular decomposition developed over the last decade, is going to beat such approaches for some time. | |
| Jul 22, 2010 at 12:04 | history | answered | Tony Huynh | CC BY-SA 2.5 |