The most vital edges in the minimum spanning tree problem
type: Item
instance of: scholarly article
title: The most vital edges in the minimum spanning tree problem
zbMATH Open document ID: 0768.68051
DOI: 10.1016/0020-0190(93)90247-7
author: Kao-Chêng Lin
author: Maw-Sheng Chern
published in: Information Processing Letters
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 167731
zbMATH Keywords: computational complexity
zbMATH Keywords: weighted network
zbMATH Keywords: most vital edges
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: NP-hard
zbMATH Keywords: branch and bound algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(93)90247-7
OpenAlex ID: W1988871016
cites work: Finding the most vital arcs in a network
cites work: Most vital links and nodes in weighted networks
cites work: Q4198056
cites work: Multi-Terminal Network Flows
cites work: Q3885184
cites work: Finding the most vital edge with respect to minimum spanning tree in weighted graphs
cites work: Determining the most vital link in a flow network
cites work: The k most vital arcs in the shortest path problem
cites work: Finding the n Most Vital Links in Flow Networks
cites work: Q3707420
cites work: Removing Arcs from a Network
Wikidata QID: Q127343631
description: scientific article; zbMATH DE number 167731