Timeline for Subgraph containing all nodes and edges that are part of length-limited simple s-t paths in an undirected graph
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Apr 2, 2014 at 15:50 | comment | added | R B | check this out. Found this paper, which seems to do a similar min cost flow reduction, but uses the special characteristics of the network to solve it faster then the general MCF algorithms. | |
| S Apr 2, 2014 at 7:48 | history | bounty ended | Lior Kogan | ||
| S Apr 2, 2014 at 7:48 | history | notice removed | Lior Kogan | ||
| Apr 2, 2014 at 7:48 | vote | accept | Lior Kogan | ||
| Apr 1, 2014 at 15:32 | answer | added | GMB | timeline score: 1 | |
| Mar 29, 2014 at 20:05 | answer | added | greg | timeline score: 1 | |
| Mar 29, 2014 at 15:04 | answer | added | R B | timeline score: 6 | |
| Mar 26, 2014 at 13:28 | history | edited | Lior Kogan | CC BY-SA 3.0 |
added 142 characters in body
|
| S Mar 26, 2014 at 13:19 | history | bounty started | Lior Kogan | ||
| S Mar 26, 2014 at 13:19 | history | notice added | Lior Kogan | Canonical answer required | |
| Mar 26, 2014 at 13:14 | history | edited | Lior Kogan | CC BY-SA 3.0 |
deleted 1013 characters in body
|
| Dec 14, 2013 at 16:18 | history | edited | Hsien-Chih Chang 張顯之 | CC BY-SA 3.0 |
modify some notations
|
| Dec 12, 2013 at 17:05 | history | edited | Lior Kogan | CC BY-SA 3.0 |
Using LaTeX
|
| Dec 12, 2013 at 10:32 | history | tweeted | twitter.com/#!/StackCSTheory/status/411081019962720256 | ||
| Dec 12, 2013 at 8:58 | history | edited | Lior Kogan | CC BY-SA 3.0 |
added 62 characters in body
|
| Dec 12, 2013 at 8:39 | history | edited | Lior Kogan | CC BY-SA 3.0 |
added 6 characters in body
|
| Dec 12, 2013 at 8:32 | history | asked | Lior Kogan | CC BY-SA 3.0 |