Element perturbation problems of optimum spanning trees with two-parameter objectives

DOI10.1016/0020-0190(94)00173-VzbMath0875.68672OpenAlexW2081950775MaRDI QIDQ674298

Yung-Cheng Chang, Lih-Hsing Hsu

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00173-v

zbMATH Keywords

ComplexityCombinatorial algorithmsMatroidSpanning trees

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
• The k most vital arcs in the shortest path problem
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs
• Maximizing Classes of Two-Parameter Objectives Over Matroids
• An efficient algorithm for K shortest simple paths
• Matroid Applications and Algorithms
• The most vital edges of matching in a bipartite graph
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Element perturbation problems of optimum spanning trees with two-parameter objectives