RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

DOI10.1093/comjnl/45.6.631zbMath1037.68101OpenAlexW2096725584WikidataQ115926385 ScholiaQ115926385MaRDI QIDQ4415912

Eleanor J. Gardiner, John W. Raymond, Peter K. Willett

Publication date: 7 August 2003

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/3568/1/willets3.pdf

zbMATH Keywords

labeled graphsvertex selection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

On the use of similarity metrics for approximate graph matching ⋮ The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs ⋮ Two approaches to determining similarity of two digraphs ⋮ Semitotal domination number of some graph operations ⋮ Kernel functions for case-based planning ⋮ Similarity measures over refinement graphs ⋮ Using local similarity measures to efficiently address approximate graph matching ⋮ Structure-based graph distance measures of high degree of precision ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ A distance measure for large graphs based on prime graphs ⋮ The maximum common edge subgraph problem: A polyhedral investigation ⋮ Polyhedral study of the maximum common induced subgraph problem ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ Application to QSAR studies of 2-furylethylene derivatives

This page was built for publication: RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs