A polynomial-time algorithm for finding most vital edges in min-max spanning tree problems

چکیده مقاله