A remark on the time complexity of the subtree problem

DOI10.1007/BF02252027zbMath0385.05029OpenAlexW1986116426MaRDI QIDQ1249180

Manfred Stadel

Publication date: 1978

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02252027

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

Graph theory (algorithmic, algebraic, and metric problems) ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets

Cites Work

• A V log V algorithm for isomorphism of triconnected planar graphs
• On the complexity of the marriage problem
• Paths, Trees, and Flowers
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A remark on the time complexity of the subtree problem