Complexity of spanning tree problems: Part I
type: Item
instance of: scholarly article
title: Complexity of spanning tree problems: Part I
zbMATH Open document ID: 0445.90088
DOI: 10.1016/0377-2217(80)90164-2
author: Paolo M. Camerini
author: Francesco Maffioli
author: Giulia Galbiati
published in: European Journal of Operational Research
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3696858
zbMATH Keywords: complexity of spanning tree problems
zbMATH Keywords: network design
zbMATH Keywords: optimum weighted trees
MaRDI profile type: Publication
full work available at URL: 0377-2217(80)90164-2
OpenAlex ID: W2072970829
cites work: Q4091421
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: Q3745296
cites work: Finding Minimum Spanning Trees
cites work: Q4083324
cites work: Q4138187
cites work: A note on two problems in connexion with graphs
cites work: The complexity of the network design problem
cites work: Q4142699
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Computing capacitated minimal spanning trees efficiently
cites work: Q4130999
cites work: The complexity of the capacitated tree problem
description: scientific article; zbMATH DE number 3696858