A Recursive Embedding Approach to Median Graph Computation
From MaRDI portal
Publication:3637694
DOI10.1007/978-3-642-02124-4_12zbMath1248.68378OpenAlexW2141778792MaRDI QIDQ3637694
E. Valveny, M. Ferrer, D. Karatzas, Horst Bunke
Publication date: 14 July 2009
Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02124-4_12
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Generalized median graph computation by means of graph embedding in vector spaces
- Inexact graph matching for structural pattern recognition
- A distance measure between attributed relational graphs for pattern recognition
- Bipartite Graph Matching for Computing the Edit Distance of Graphs
- Graph Embedding in Vector Spaces by Means of Prototype Selection
- Graph-Theoretic Techniques for Web Content Mining
- Weighted mean of a pair of graphs
This page was built for publication: A Recursive Embedding Approach to Median Graph Computation
