Matching graphs with unique node labels
From MaRDI portal
Publication:851709
Recommendations
Cites work
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 1957457 (Why is no real title available?)
- scientific article; zbMATH DE number 2043351 (Why is no real title available?)
- scientific article; zbMATH DE number 2043368 (Why is no real title available?)
- scientific article; zbMATH DE number 1744977 (Why is no real title available?)
- scientific article; zbMATH DE number 2090201 (Why is no real title available?)
- scientific article; zbMATH DE number 2090206 (Why is no real title available?)
- A distance measure between attributed relational graphs for pattern recognition
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- An Algorithm for Subgraph Isomorphism
- Backtrack search algorithms and the maximal common subgraph problem
- Connected components in random graphs with given expected degree sequences
- Constraint satisfaction algorithms for graph pattern matching
- Isomorphism of graphs of bounded valence can be tested in polynomial time
Cited in
(10)- Efficient Suboptimal Graph Isomorphism
- Data graph formulation as the minimum-weight maximum-entropy problem
- Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning
- Node matching computation between two large graphs in linear computational cost
- Fifty years of graph matching, network alignment and network comparison
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- Graph unification and matching
- Approximation of graph edit distance based on Hausdorff matching
- A comparative analysis of new graph distance measures and graph edit distance
- scientific article; zbMATH DE number 2043351 (Why is no real title available?)
This page was built for publication: Matching graphs with unique node labels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851709)