Generalized median graph computation by means of graph embedding in vector spaces
Authors:
- M. FerrerMFM. Ferrer
- E. ValvenyEVE. Valveny
- F. SerratosaFSF. Serratosa
- K. RiesenKRK. Riesen
- H. BunkeHBH. Bunke
- 1 April 2010
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 43 (4) , 1642-1655
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A binary linear programming formulation of the graph edit distanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Object Recognition as Many-to-Many Feature MatchingInternational Journal of Computer Vision, 2006
- Median graph computation for graph clusteringSoft Computing, 2005
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- Weighted Mean of a Pair of GraphsComputing, 2001
- An median graphs: properties, algorithms, and applicationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- Algorithmic applications of low-distortion geometric embeddings2001
- Topology of strings: Median string is NP-completeTheoretical Computer Science, 2000
- The algebraic degree of geometric optimization problemsDiscrete & Computational Geometry, 1988
- Inexact graph matching for structural pattern recognitionPattern Recognition Letters, 1983