Timeline for Test cases for graph embeddability problem
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 14, 2016 at 13:59 | history | bounty ended | padawan | ||
| S Mar 14, 2016 at 13:59 | history | notice removed | padawan | ||
| Mar 11, 2016 at 10:05 | comment | added | padawan | For question 1, I have made an edit. And for 2, I have updated the link to a research paper that proves $k$-embeddability problem is strongly NP-hard. | |
| Mar 11, 2016 at 10:05 | history | edited | padawan | CC BY-SA 3.0 |
added 248 characters in body
|
| Mar 11, 2016 at 10:01 | answer | added | D.W.♦ | timeline score: 4 | |
| Mar 11, 2016 at 9:57 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 103 characters in body
|
| Mar 11, 2016 at 9:49 | comment | added | padawan | @D.W. I already have an algorithm that runs in polynomial-time. I just want to know if the algorithm can actually solve all instances of the problem. Of course, I cannot test with infinitely many instances, but can I somehow find some extreme test cases which shows that the algorithm is correct? | |
| Mar 11, 2016 at 9:25 | history | edited | padawan | CC BY-SA 3.0 |
added 41 characters in body
|
| Mar 11, 2016 at 9:06 | history | edited | padawan | CC BY-SA 3.0 |
added 194 characters in body
|
| S Mar 9, 2016 at 21:38 | history | bounty started | padawan | ||
| S Mar 9, 2016 at 21:38 | history | notice added | padawan | Draw attention | |
| Feb 23, 2016 at 21:41 | history | asked | padawan | CC BY-SA 3.0 |