A distance measure for large graphs based on prime graphs
From MaRDI portal
Publication:531270
DOI10.1016/j.patcog.2014.03.014zbMath1342.68278OpenAlexW2037012153MaRDI QIDQ531270
Abir M'Baya, Hamamache Kheddouci, Hamida Seba, Riadh Khennoufa, Sofiane Lagraa
Publication date: 3 August 2016
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.03.014
Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Uses Software
Cites Work
- A survey of the algorithmic aspects of modular decomposition
- Recent advances in graph-based pattern recognition with applications in document analysis
- A survey of graph edit distance
- A Riemannian approach to graph embedding
- Automatic learning of cost functions for graph edit distance
- Structure-based graph distance measures of high degree of precision
- On the X-join decomposition for undirected graphs
- Efficient graph representations
- Linear-time modular decomposition of directed graphs
- Structural pattern recognition using genetic algorithms
- Incremental modular decomposition
- An eigendecomposition approach to weighted graph matching problems
- An Algorithm for Subgraph Isomorphism
- A graph distance metric based on the maximal common subgraph
- RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
- Inexact graph matching for structural pattern recognition
- A distance measure between attributed relational graphs for pattern recognition
- Graph distances using graph union
- Learning Theory and Kernel Machines
- Algorithm Theory - SWAT 2004
- Structural, Syntactic, and Statistical Pattern Recognition
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A distance measure for large graphs based on prime graphs
