On the complexity of finding multi-constrained spanning trees
type: Item
instance of: scholarly article
title: On the complexity of finding multi-constrained spanning trees
zbMATH Open document ID: 0498.90078
DOI: 10.1016/0166-218X(83)90014-8
published in: Discrete Applied Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3786521
zbMATH Keywords: classification of undirected spanning tree problems
zbMATH Keywords: computational complexity
zbMATH Keywords: undirected, unweighted graph
zbMATH Keywords: multi-constrained, unweighted case
author: Paolo M. Camerini
author: Giulia Galbiati
author: Francesco Maffioli
MaRDI profile type: Publication
cites work: Complexity of spanning tree problems: Part I
cites work: Q4198056
cites work: The Bounded Path Tree Problem
description: scientific article; zbMATH DE number 3786521