Directed Graph Pattern Matching and Topological Embedding
From MaRDI portal
Recommendations
- Linear matching-time algorithm for the directed graph isomorphism problem
- Simulation relations for pattern matching in directed graphs
- Finding approximate patterns in undirected acyclic graphs
- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
- Algorithms for topology-free and alignment network queries
Cited in
(6)- Strong simulation: capturing topology in graph pattern matching
- An inductive characterization of matching in binding bigraphs
- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
- Linear matching-time algorithm for the directed graph isomorphism problem
- Matching of bigraphs
- Simulation relations for pattern matching in directed graphs
This page was built for publication: Directed Graph Pattern Matching and Topological Embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128193)