Finding the k most vital edges in the minimum spanning tree problem
type: Item
instance of: scholarly article
title: Finding the k most vital edges in the minimum spanning tree problem
zbMATH Open document ID: 0903.68135
DOI: 10.1016/S0167-8191(97)00098-7
author: W. Liang
author: Xiaojun Shen
published in: Parallel Computing
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1189713
zbMATH Keywords: combinatorial algorithms
zbMATH Keywords: minimum spanning trees
zbMATH Keywords: most vital edges
zbMATH Keywords: NC algorithms
zbMATH Keywords: network optimization
MaRDI profile type: Publication
full work available at URL: s0167-8191(97)00098-7
OpenAlex ID: W2042373356
description: scientific article; zbMATH DE number 1189713