Pages that link to "Item:Q5005120"
From MaRDI portal
The following pages link to Graph Similarity and Approximate Isomorphism (Q5005120):
Displaying 13 items.
- Similarity matrices for colored graphs (Q1043704) (← links)
- Iterative methods for low rank approximation of graph similarity matrices (Q1940336) (← links)
- Robust similarity between hypergraphs based on valuations and mathematical morphology operators (Q2255814) (← links)
- Efficient identifications of structural similarities for graphs (Q2444149) (← links)
- Measuring Structural Similarities of Graphs in Linear Time (Q3167379) (← links)
- A large database of graphs and its use for benchmarking graph isomorphism algorithms (Q4417659) (← links)
- (Q4782738) (← links)
- (Q4856890) (← links)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- (Q5090449) (← links)
- The Complexity of Homomorphism Indistinguishability (Q5092416) (← links)
- Benchmark Graphs for Practical Graph Isomorphism (Q5111749) (← links)
- Study of similar graph containment search and index (Q5188887) (← links)