A remark on the time complexity of the subtree problem
type: Item
instance of: scholarly article
title: A remark on the time complexity of the subtree problem
zbMATH Open document ID: 0385.05029
DOI: 10.1007/BF02252027
author: Manfred Stadel
published in: Computing
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05-04
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3598503
MaRDI profile type: Publication
cites work: Q4091421
cites work: Paths, Trees, and Flowers
cites work: Q4120604
cites work: On the complexity of the marriage problem
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: A V log V algorithm for isomorphism of triconnected planar graphs
cites work: Q3875946
cites work: Q4148000
full work available at URL: https://doi.org/10.1007/bf02252027
OpenAlex ID: W1986116426
description: scientific article; zbMATH DE number 3598503