Timeline for Do sparse DAGs can have large min-cuts?
Current License: CC BY-SA 3.0
9 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/
|
|
| Jan 28, 2013 at 15:33 | history | edited | Stasys | CC BY-SA 3.0 |
Corrected a typo in David's name.
|
| Jan 27, 2013 at 20:17 | answer | added | Stasys | timeline score: 5 | |
| Jan 27, 2013 at 12:10 | history | edited | Stasys | CC BY-SA 3.0 |
Removed useless remark, because long paths can be prolonged to st-paths
|
| Jan 22, 2013 at 10:51 | history | edited | Stasys | CC BY-SA 3.0 |
A small correction in the expression for c_k(T_n)
|
| Jan 21, 2013 at 22:49 | history | edited | Stasys | CC BY-SA 3.0 |
slight change in wording
|
| Jan 21, 2013 at 22:20 | history | edited | Stasys | CC BY-SA 3.0 |
a misleading typo: divided by t, not times t
|
| Jan 21, 2013 at 22:12 | history | edited | Stasys | CC BY-SA 3.0 |
1-cut is just a cut
|
| Jan 21, 2013 at 20:39 | history | asked | Stasys | CC BY-SA 3.0 |