The hybrid spanning tree problem
type: Item
instance of: scholarly article
title: The hybrid spanning tree problem
zbMATH Open document ID: 0810.90125
DOI: 10.1016/0377-2217(94)90037-X
author: V. Pereyra
published in: European Journal of Operational Research
publication date: 1994-09-15T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 639299
zbMATH Keywords: computational analysis
zbMATH Keywords: minimal spanning tree
zbMATH Keywords: hybrid spanning tree
MaRDI profile type: Publication
cites work: The probabilistic minimum spanning tree problem
cites work: Minimal ratio spanning trees
cites work: A good algorithm for smallest spanning trees with a degree constraint
cites work: An improved equivalence algorithm
cites work: Efficient Planarity Testing
cites work: Stochastic bottleneck spanning tree problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q4739657
cites work: Q3707420
cites work: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
description: scientific article; zbMATH DE number 639299