scientific article; zbMATH DE number 1444314

MaRDI QIDQ4953343zbMATH OpenFDO

Authors W. Liang, George Havas

Publication date 9 May 2000

zbMATH Keywords

vital edge problem

Mathematics Subject Classification ID

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

Recommendations

• Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
• Finding the k most vital edges in the minimum spanning tree problem
• Finding the k most vital edges with respect to minimum spanning tree
• Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem

Cited in

(7)

• Finding the k most vital edges in the minimum spanning tree problem
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs
• The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs
• Efficient determination of the k most vital edges for the minimum spanning tree problem
• Finding the k most vital edges with respect to minimum spanning tree
• Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
• Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953343)