Timeline for Subgraph containing all nodes and edges that are part of length-limited simple s-t paths in a digraph
Current License: CC BY-SA 3.0
16 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 1, 2014 at 11:19 | answer | added | R B | timeline score: 1 | |
| Dec 12, 2013 at 17:09 | history | edited | Lior Kogan | CC BY-SA 3.0 |
Using LaTeX
|
| Dec 12, 2013 at 9:55 | history | edited | Lior Kogan | CC BY-SA 3.0 |
Added link to similar questiong regarding undirected graph
|
| Dec 10, 2013 at 14:40 | vote | accept | Lior Kogan | ||
| Dec 10, 2013 at 11:53 | answer | added | Kristoffer Arnsfelt Hansen | timeline score: 6 | |
| Dec 9, 2013 at 18:26 | comment | added | Lior Kogan | @KristofferArnsfeltHansen: There are no more constraints. | |
| Dec 9, 2013 at 18:24 | comment | added | D.W. | @KristofferArnsfeltHansen, interesting! Would you like to add that as an answer and provide a reference for that result? It sounds like it answers the original question in the negative. | |
| Dec 9, 2013 at 18:20 | answer | added | D.W. | timeline score: 0 | |
| Dec 9, 2013 at 17:56 | comment | added | Kristoffer Arnsfelt Hansen | Are there more constraints to your problem? Recall that the following problem is NP-complete: Given digraph $G$ and vertices $s,t,v$, does there exist a $(s,t)$ path also containing $v$? | |
| Dec 9, 2013 at 17:26 | review | Suggested edits | |||
| Dec 12, 2013 at 9:51 | |||||
| Dec 8, 2013 at 22:21 | history | tweeted | twitter.com/#!/StackCSTheory/status/409809951981572096 | ||
| Dec 8, 2013 at 21:23 | answer | added | Mathias Rav | timeline score: 0 | |
| Dec 8, 2013 at 18:42 | history | edited | Lior Kogan | CC BY-SA 3.0 |
deleted 224 characters in body
|
| Dec 8, 2013 at 18:26 | history | edited | Lior Kogan | CC BY-SA 3.0 |
edited title
|
| Dec 8, 2013 at 18:21 | history | asked | Lior Kogan | CC BY-SA 3.0 |