RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

DOI10.1093/COMJNL/45.6.631MaRDI QIDQ4415912zbMATH OpenOpenAlexWikidataFDO

Authors John W. Raymond, Eleanor J. Gardiner, 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)

Recommendations

• scientific article; zbMATH DE number 2043361
• Computing and Combinatorics
• Using local similarity measures to efficiently address approximate graph matching
• scientific article; zbMATH DE number 7380509
• scientific article; zbMATH DE number 2090205

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415912)