Timeline for Finding commonalities and differences in directed hierarchical graph
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| 22 hours ago | history | edited | YCor | CC BY-SA 4.0 |
fixed English
|
| yesterday | comment | added | Possibleble | Thank you. For example: If a graph was created by copy+paste+modify of another graph, I want to know that. So if a graph has the same edge or node types (possibly even the same subtypes of elements) and is generally structured in the same way, this could indicate this. Also: Are the same nodes/edges at same hierarchy level? Was somewhere one edge added as compared to another graph? I guess I would then also map the elements of the graphs onto another to analyze this? | |
| yesterday | comment | added | Daniele Tampieri | Hi and welcome to the MathOverflow. Your question is quite interesting, in that it resembles a classification problem: this is something very common in mathematics. Nevertheless tis imprecise: how would you define "structural similarity"? If you don't know what do you want to emphasise and find out od a structure, how could anyone help you by sharing methods to determine this property? | |
| S yesterday | review | First questions | |||
| yesterday | |||||
| S yesterday | history | asked | Possibleble | CC BY-SA 4.0 |