Faster Subtree Isomorphism

DOI10.1006/jagm.1999.1044zbMath0949.68122OpenAlexW2128695242MaRDI QIDQ4935309

Dekel Tsur, Ron Shamir

Publication date: 19 March 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.5818

zbMATH Keywords

subgraph isomorphismsubtree isomorphism

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (20)

Probabilistic frequent subtrees for efficient graph classification and retrieval ⋮ Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees ⋮ Probabilistic and exact frequent subtree mining in graphs beyond forests ⋮ An inductive characterization of matching in binding bigraphs ⋮ A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs ⋮ On retracts, absolute retracts, and foldings in cographs ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ Algorithms for topology-free and alignment network queries ⋮ XRules: an effective algorithm for structural classification of XML data ⋮ Comparing universal covers in polynomial time ⋮ An algebraic view of the relation between largest common subtrees and smallest common supertrees ⋮ Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns ⋮ Approximate labelled subtree homeomorphism ⋮ FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES ⋮ Covering a Tree by a Forest ⋮ 2-tree probe interval graphs have a large obstruction set ⋮ Constrained tree inclusion ⋮ Bigraphs with sharing ⋮ Matching of Bigraphs ⋮ Comparing and distinguishing the structure of biological branching

This page was built for publication: Faster Subtree Isomorphism