Timeline for Partitioning a bipartite graph to get disjoint components of same size
Current License: CC BY-SA 3.0
11 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/
|
|
| Oct 21, 2016 at 17:22 | comment | added | aelguindy | @D.W. Np, if you look at my edit history, I got that same misunderstanding twice ;). | |
| Oct 21, 2016 at 17:21 | comment | added | D.W.♦ | Oops, my mistake! Thanks for explaining. | |
| Oct 21, 2016 at 17:19 | comment | added | aelguindy | @D.W. OP asks for an algorithm that runs in poly(E) with an exponent that is NOT a function of n. Something like $O(2^{f(n)} poly(E))$. I am guessing that this is hard, I just cannot prove it yet. | |
| Oct 21, 2016 at 14:06 | history | undeleted | aelguindy | ||
| Oct 21, 2016 at 14:06 | history | deleted | aelguindy | via Vote | |
| Oct 21, 2016 at 14:01 | history | undeleted | aelguindy | ||
| Oct 21, 2016 at 14:00 | history | edited | aelguindy | CC BY-SA 3.0 |
added 73 characters in body
|
| Oct 21, 2016 at 13:50 | history | edited | aelguindy | CC BY-SA 3.0 |
deleted 834 characters in body
|
| Oct 21, 2016 at 12:01 | history | deleted | aelguindy | via Vote | |
| Oct 21, 2016 at 11:59 | history | answered | aelguindy | CC BY-SA 3.0 |