Faster Subtree Isomorphism
From MaRDI portal
Recommendations
Cited in
(45)- Approximate labelled subtree homeomorphism
- A note on the subtree isomorphism for ordered trees and related problems
- Strings, trees, and patterns
- Faster algorithms for subgraph isomorphism of k-connected partial k-trees
- Probabilistic frequent subtrees for efficient graph classification and retrieval
- On retracts, absolute retracts, and foldings in cographs
- A speed-up for the commute between subword trees and DAWGs.
- An inductive characterization of matching in binding bigraphs
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Algorithms for topology-free and alignment network queries
- Bigraphs with sharing
- Comparing and distinguishing the structure of biological branching
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- XRules: an effective algorithm for structural classification of XML data
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- 2-tree probe interval graphs have a large obstruction set
- Constrained tree inclusion
- Matching of bigraphs
- On an algorithm of Zemlyachenko for subtree isomorphism
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
- Covering a tree by a forest
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- scientific article; zbMATH DE number 4064509 (Why is no real title available?)
- scientific article; zbMATH DE number 1303580 (Why is no real title available?)
- scientific article; zbMATH DE number 1088188 (Why is no real title available?)
- Faster algorithms for finding and counting subgraphs
- Tree Pattern Matching to Subset Matching in Linear Time
- Subtree isomorphism revisited
- Subtree isomorphism revisited
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
- Faster algorithms for the maximum common subtree isomorphism problem
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
- Advanced indexing operations on substitution trees
- SUBTREE ISOMORPHISM IS IN DLOG FOR NESTED TREES
- An algorithm for testing an isomorphism for Husimi trees.
- Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- A BULT algorithm for tree isomorphism
- G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU
- Dichotomies for tree minor containment with structural parameters
- Temporal subgraph matching method for multi-connected temporal graph
- Dichotomies for tree minor containment with structural parameters
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree
- Subtree isomorphism is in random NC
- Comparing universal covers in polynomial time
This page was built for publication: Faster Subtree Isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935309)
