An Analysis of a Good Algorithm for the Subtree Problem, Corrected
From MaRDI portal
Publication:3833624
DOI10.1137/0218062zbMath0677.68059MaRDI QIDQ3833624
Steven W. Reyner, Rakesh M. Verma
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218062
Related Items
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs, Maximum tree-packing in time O(n5/2), Strings, trees, and patterns, Tight complexity bounds for term matching problems, Maximum tree-packing in time \(O(n^{5/2})\), A new vertex coloring heuristic and corresponding chromatic number, Constrained tree inclusion