Structural equivalence is an easily understood property of networks which, if present, can be exploited to greatly speed up subgraph search. Intuitively, two vertices are structurally equivalent to each other if they can be “swapped” without changing the graph structure.
Jan 9, 2023 · We introduce rigorous definitions of structural equivalence and establish conditions for when it can be safely used to generate more solutions.
This work addresses how to quantify these effects and how to use symmetries to increase the efficiency of subgraph isomorphism algorithms. We introduce rigorous ...
Structural Equivalence refers to the ability to exchange two vertices in a graph without changing the structure of the graph. We provide basic definitions ...
Missing: Matching. | Show results with:Matching.
Abstract—Structural Equivalence refers to the ability to ex- change two vertices in a graph without changing the structure of the graph.
This work addresses how to quantify these effects and how to use symmetries to increase the efficiency of subgraph isomorphism algorithms. We introduce rigorous ...
This item is not available for download from eScholarship. Share. EmailFacebook. Structural Equivalence in Subgraph Matching. 2023.
People also ask
What is network structural equivalence?
How do you check if a graph is a subgraph of another?
Jul 17, 2024 · Two nodes are automorphically equivalent if there is an automorphism ϕ : V → V on the graph mapping one node to the other. Then given this ...
Structural equivalence of two actors is the degree to which the two actors have the same profile of relations across alters (all other actors in the network).
Two nodes are structurally equivalent if they are connected to the same others. Thus, their patterns of connectivity (eg, their row in the adjacency matrix) is ...
Missing: Matching. | Show results with:Matching.