Timeline for Distance queries to reconstruct an unknown graph
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2019 at 4:36 | history | edited | Gerhard Paseman | CC BY-SA 4.0 |
edited body
|
| Dec 22, 2019 at 4:34 | comment | added | Gerhard Paseman | I'll leave the formal details to others. However, the "-gulation" construction seems to allow modifications to cover both parts of Joseph's Q2, and that graphs which are triangulable in Joseph's sense may be only those which have few cycles, and those cycles being large. Gerhard "Has Been Around The Block" Paseman, 2019.12.21. | |
| Dec 22, 2019 at 4:24 | history | answered | Gerhard Paseman | CC BY-SA 4.0 |