Distance measures between attributed graphs and second-order random graphs
From MaRDI portal
Recommendations
- Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
- Estimating the joint probability distribution of random vertices and arcs by means of second-order random graphs
- Distance between attributed graphs and function-described graphs relaxing \(2^{\text{nd}}\) order restrictions
- A Structural and Semantic Probabilistic Model for Matching and Representing a Set of Graphs
- scientific article; zbMATH DE number 4066386
Cited in
(7)- A Structural and Semantic Probabilistic Model for Matching and Representing a Set of Graphs
- Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
- scientific article; zbMATH DE number 4066386 (Why is no real title available?)
- scientific article; zbMATH DE number 1532351 (Why is no real title available?)
- A new error-correcting distance for attributed relational graph problems
- Distance between attributed graphs and function-described graphs relaxing \(2^{\text{nd}}\) order restrictions
- Estimating the joint probability distribution of random vertices and arcs by means of second-order random graphs
This page was built for publication: Distance measures between attributed graphs and second-order random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466295)