Timeline for Lower and upper bounds on the diameter of 3-regular graphs obtained after reducing practical real world problem instances to #3-regular Vertex Cover
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11, 2012 at 14:08 | vote | accept | Giorgio Camerani | ||
| Aug 24, 2011 at 8:14 | vote | accept | Giorgio Camerani | ||
| Sep 11, 2012 at 14:08 | |||||
| Aug 23, 2011 at 6:58 | comment | added | Giorgio Camerani | @Suresh: It would be a real pleasure to engage a conversation with you on counting solutions of NP-hard problems. Surprisingly, I happen to have something to ask you as well. I've just sent you an e-mail from my real address. | |
| Aug 23, 2011 at 5:10 | comment | added | Suresh Venkat | (apologies for the off-topic comment): @Walter, I had a question related to counting solns to NP-hard problems, and was wondering if I could email you directly ? unfortunately, your registered email bounced, so maybe you could email me ? (my email is on my profile page) | |
| Aug 22, 2011 at 22:02 | history | edited | Kaveh |
edited tags
|
|
| Aug 22, 2011 at 21:47 | answer | added | David Eppstein | timeline score: 4 | |
| Aug 22, 2011 at 21:29 | history | asked | Giorgio Camerani | CC BY-SA 3.0 |