scientific article; zbMATH DE number 1691467

MaRDI QIDQ2763396zbMATH OpenFDO

Authors Simon Günter, Xiaoyi Jiang, Horst Bunke

Publication date 15 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2013/20130001

zbMATH Keywords

Graph matching, error-tolerant matching, edit distance, median graph, weighted mean

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• Weighted mean of a pair of graphs
• Heuristics for the generalized median graph problem
• scientific article; zbMATH DE number 4066386
• On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs
• Bridging the Gap between Graph Edit Distance and Kernel Machines

Cited in

(7)

• Fuzzy multilevel graph embedding
• Statistical graph space analysis
• A comparative analysis of multidimensional features of objects resembling sets of graphs
• Prototype selection for dissimilarity-based classifiers
• On the geometry of graph spaces
• A Structural and Semantic Probabilistic Model for Matching and Representing a Set of Graphs
• Weighted mean of a pair of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763396)