Simulation relations for pattern matching in directed graphs
From MaRDI portal
Publication:388784
DOI10.1016/j.tcs.2013.03.021zbMath1292.68135OpenAlexW2082035152MaRDI QIDQ388784
Johanna Björklund, Lars-Daniel Öhman
Publication date: 7 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.021
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- A note on two problems in connexion with graphs
- A survey on tree edit distance and related problems
- Statistical analysis of network data. Methods and models
- Bisimulation relations for weighted automata
- Equational Axioms for Probabilistic Bisimilarity
- Understanding the Complexity of Induced Subgraph Isomorphisms
- A Backward and a Forward Simulation for Weighted Tree Automata
- Three Partition Refinement Algorithms
- An Algorithm for Subgraph Isomorphism
- More Efficient Algorithm for Ordered Tree Inclusion
- Term Rewriting and All That
- Ordered and Unordered Tree Inclusion
- Recognizing small subgraphs
- Weighted Tree Automata and Tree Transducers
- Fibonacci heaps and their uses in improved network optimization algorithms
- Computing Simulations over Tree Automata
- Iteration 2-theories
- Finding approximate patterns in undirected acyclic graphs
This page was built for publication: Simulation relations for pattern matching in directed graphs
