Timeline for Graph Theory: question regarding a class of digraph
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 14, 2011 at 19:02 | comment | added | Gerhard Paseman | If you needed to compute iterates, find connected components, or store it efficiently, you might mention that. Otherwise, it is not clear how an answer will help, as most optimized algorithms handle more general cases depending on the action desired. Gerhard "Email Me About System Design" Paseman, 2011.07.14 | |
| Jul 14, 2011 at 17:44 | vote | accept | jinxidoru | ||
| Jul 14, 2011 at 17:43 | vote | accept | jinxidoru | ||
| Jul 14, 2011 at 17:44 | |||||
| Jul 14, 2011 at 17:33 | answer | added | David Eppstein | timeline score: 7 | |
| Jul 14, 2011 at 17:09 | answer | added | Qiaochu Yuan | timeline score: 5 | |
| Jul 14, 2011 at 16:19 | history | asked | jinxidoru | CC BY-SA 3.0 |