Skip to main content
MathOverflow

Return to Question

fixed English
Source Link
YCor
YCor
  • 63.9k
  • 5
  • 187
  • 286

Finding Commonalitiescommonalities and Differencesdifferences in Directed Hierarchical Graphdirected hierarchical graph

I have a directed graph with hierarchical structure, multiple nodes and edge types. One node can have different in- and outgoing connections. There would also be more details to some of the nodes --– e.g. subtypes but I am not sure how I can incooperateincorporate this information in the analysis.

The graph data is originally stored in XML. For now, I parsed it and stored it in a json file. So I have the file with all different nodes and edges and how they are connected.

I want to identify structural similarities and dissimilarities while consider hierarchy of the graphs.

What methods exist to compare directed multi-edge hierarchical graphs in terms of structure?

My Goal is to be able to make concrete Statements: E.g.: Graph1 and Graph2 are structurally 80% similar --– and then I can somehow print/locate the 20% where they are different in strucutrestructure, e. g. I work in Python.

Finding Commonalities and Differences in Directed Hierarchical Graph

I have a directed graph with hierarchical structure, multiple nodes and edge types. One node can have different in- and outgoing connections. There would also be more details to some of the nodes -- e.g. subtypes but I am not sure how I can incooperate this information in the analysis.

The graph data is originally stored in XML. For now, I parsed it and stored it in a json file. So I have the file with all different nodes and edges and how they are connected.

I want to identify structural similarities and dissimilarities while consider hierarchy of the graphs.

What methods exist to compare directed multi-edge hierarchical graphs in terms of structure?

My Goal is to be able to make concrete Statements: E.g.: Graph1 and Graph2 are structurally 80% similar -- and then I can somehow print/locate the 20% where they are different in strucutre, e. g. I work in Python.

Finding commonalities and differences in directed hierarchical graph

I have a directed graph with hierarchical structure, multiple nodes and edge types. One node can have different in- and outgoing connections. There would also be more details to some of the nodes – e.g. subtypes but I am not sure how I can incorporate this information in the analysis.

The graph data is originally stored in XML. For now, I parsed it and stored it in a json file. So I have the file with all different nodes and edges and how they are connected.

I want to identify structural similarities and dissimilarities while consider hierarchy of the graphs.

What methods exist to compare directed multi-edge hierarchical graphs in terms of structure?

My Goal is to be able to make concrete Statements: E.g.: Graph1 and Graph2 are structurally 80% similar – and then I can somehow print/locate the 20% where they are different in structure, e. g. I work in Python.

Source Link
Possibleble
Possibleble
  • 11
  • 1

Finding Commonalities and Differences in Directed Hierarchical Graph

I have a directed graph with hierarchical structure, multiple nodes and edge types. One node can have different in- and outgoing connections. There would also be more details to some of the nodes -- e.g. subtypes but I am not sure how I can incooperate this information in the analysis.

The graph data is originally stored in XML. For now, I parsed it and stored it in a json file. So I have the file with all different nodes and edges and how they are connected.

I want to identify structural similarities and dissimilarities while consider hierarchy of the graphs.

What methods exist to compare directed multi-edge hierarchical graphs in terms of structure?

My Goal is to be able to make concrete Statements: E.g.: Graph1 and Graph2 are structurally 80% similar -- and then I can somehow print/locate the 20% where they are different in strucutre, e. g. I work in Python.