Timeline for Algorithms on graphs of bounded degeneracy/arboricity
Current License: CC BY-SA 2.5
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 8, 2012 at 11:24 | answer | added | Martin Vatshelle | timeline score: 1 | |
| Aug 19, 2011 at 13:48 | answer | added | anonymous | timeline score: 1 | |
| Jan 15, 2010 at 1:56 | vote | accept | Rune | ||
| Jan 15, 2010 at 1:56 | history | bounty ended | Rune | ||
| Jan 11, 2010 at 3:34 | comment | added | Rune | Thanks for the comments. I know there's a lot of work in parametrized complexity using tree width, but I don't know if that works for bounded arboricity too. | |
| Jan 11, 2010 at 0:29 | answer | added | Carter Tazio Schonwald | timeline score: 3 | |
| Jan 11, 2010 at 0:20 | comment | added | François G. Dorais | Or "fixed-parameter tractability". The standard text used to be "Parameterized Complexity" by Downey and Fellows, but the field progressed quickly so it might be a little dated by now. | |
| Jan 10, 2010 at 22:37 | answer | added | David Eppstein | timeline score: 11 | |
| Jan 10, 2010 at 19:58 | comment | added | Reid Barton | I think the keyword you want is "parameterized complexity". | |
| Jan 10, 2010 at 19:22 | history | bounty started | Rune | ||
| Jan 3, 2010 at 5:47 | history | edited | Ben Webster♦ |
edited tags
|
|
| Jan 2, 2010 at 5:04 | history | asked | Rune | CC BY-SA 2.5 |