Pages that link to "Item:Q4415912"
From MaRDI portal
The following pages link to RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs (Q4415912):
Displaying 15 items.
- Two approaches to determining similarity of two digraphs (Q395481) (← links)
- Similarity measures over refinement graphs (Q420926) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Structure-based graph distance measures of high degree of precision (Q947972) (← links)
- Application to QSAR studies of 2-furylethylene derivatives (Q1029762) (← links)
- The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs (Q1619196) (← links)
- The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
- Polyhedral study of the maximum common induced subgraph problem (Q1761750) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- On the use of similarity metrics for approximate graph matching (Q2883637) (← links)
- Semitotal domination number of some graph operations (Q6064552) (← links)
- Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
