Timeline for What is a good algorithm to measure similarity between isomorphic graphs with different node labels?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 8, 2021 at 15:07 | comment | added | Shaun Han | @BrendanMcKay If there are multiple isomorphisms, then the similarity should average over the similarity w.r.t. each isomorphism | |
| Oct 8, 2021 at 14:25 | comment | added | Brendan McKay | There can be more than one isomorphism. Are you considering a fixed isomorphism, an average over isomorphisms, the isomorphism giving the best matching, or something else? | |
| Oct 8, 2021 at 8:26 | history | edited | Shaun Han | CC BY-SA 4.0 |
added 1 character in body
|
| Oct 8, 2021 at 8:01 | history | edited | Shaun Han | CC BY-SA 4.0 |
deleted 146 characters in body
|
| Oct 8, 2021 at 7:54 | history | edited | Shaun Han | CC BY-SA 4.0 |
deleted 146 characters in body
|
| S Oct 8, 2021 at 7:36 | review | First questions | |||
| Oct 8, 2021 at 8:18 | |||||
| S Oct 8, 2021 at 7:36 | history | asked | Shaun Han | CC BY-SA 4.0 |