Timeline for Reconstructing a graph from shortest paths information
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2023 at 22:01 | comment | added | ABIM | I'm not sure this is POLY since this seems to require looping through all possible (connected) graphs on V vertices... | |
| Dec 20, 2016 at 15:35 | comment | added | Tony Huynh | You're welcome. I think the standard protocol is to ask a new question. You can link to this question in the description of the new question if you like | |
| Dec 20, 2016 at 15:19 | comment | added | Mohammad Al-Turkistany | Thanks for your answer. I guess an interesting problem is restricting $A$ to contain only distances greater than 2 . Should I add this variant to the post or should I post a new question? | |
| Dec 20, 2016 at 14:11 | vote | accept | Mohammad Al-Turkistany | ||
| Dec 20, 2016 at 14:07 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 3 characters in body
|
| Dec 20, 2016 at 13:57 | history | answered | Tony Huynh | CC BY-SA 3.0 |