Two approaches to determining similarity of two digraphs

DOI10.1134/S1064230712030057zbMATH Open1280.05051MaRDI QIDQ395481FDOQ395481

Authors: V. A. Kokhov 

Publication date: 29 January 2014

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

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

zbMATH Keywords

similarity of layout of fragments

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Video indexing and similarity retrieval by largest common subgraph detection using decision trees
• Title not available (Why is that?)
• A graph distance metric based on the maximal common subgraph
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

Cited In (6)

• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Title not available (Why is that?)

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)