A Recursive Embedding Approach to Median Graph Computation
From MaRDI portal
Recommendations
- Generalized median graph computation by means of graph embedding in vector spaces
- scientific article; zbMATH DE number 2043370
- Median graphs: A genetic approach based on new theoretical properties
- Heuristics for the generalized median graph problem
- On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs
Cites work
- A distance measure between attributed relational graphs for pattern recognition
- Bipartite Graph Matching for Computing the Edit Distance of Graphs
- Generalized median graph computation by means of graph embedding in vector spaces
- Graph Embedding in Vector Spaces by Means of Prototype Selection
- Graph-Theoretic Techniques for Web Content Mining
- Inexact graph matching for structural pattern recognition
- Weighted mean of a pair of graphs
Cited in
(8)- Recognizing median graphs in subquadratic time
- Decomposition and \(l_1\)-embedding of weakly median graphs
- Median graphs: A genetic approach based on new theoretical properties
- Generalized median graphs and applications
- scientific article; zbMATH DE number 2043370 (Why is no real title available?)
- On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs
- Embedding graphs as isometric medians
- Generalized median graph computation by means of graph embedding in vector spaces
This page was built for publication: A Recursive Embedding Approach to Median Graph Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637694)