Two approaches to determining similarity of two digraphs

DOI10.1134/S1064230712030057MaRDI QIDQ395481zbMATH OpenFDO

Authors V. A. Kokhov

Publication date 29 January 2014

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

similarity of layout of fragments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Recommendations

• A new method of measuring similarity for a special class of directed graphs
• scientific article; zbMATH DE number 2038751
• Subgraphs as a measure of similarity
• Distance patterns in structural similarity
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach

Cites work

• scientific article; zbMATH DE number 49984 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A graph distance metric based on the maximal common subgraph
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• Video indexing and similarity retrieval by largest common subgraph detection using decision trees

Cited in

(6)

• scientific article; zbMATH DE number 4039703 (Why is no real title available?)
• scientific article; zbMATH DE number 2038751 (Why is no real title available?)
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 2089760 (Why is no real title available?)
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching

This page was built for publication: Two approaches to determining similarity of two digraphs

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