A Structural and Semantic Probabilistic Model for Matching and Representing a Set of Graphs

DOI10.1007/978-3-642-02124-4_17zbMATH Open1248.68389OpenAlexW1531807959MaRDI QIDQ3637699

Could not fetch data.

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_17

zbMATH Keywords

graph matchingprobabilistic modelgraph clusteringstructural relationsgraph synthesissemantic relations

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
• Title not available (Why is that?)

Related Items (2)

FLUID: a common model for semantic structural graph summaries based on equivalence relations ⋮ Conceptual Structures for Knowledge Creation and Communication

This page was built for publication: A Structural and Semantic Probabilistic Model for Matching and Representing a Set of Graphs

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