The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs

DOI10.1007/BF02074877MaRDI QIDQ1198968zbMATH OpenFDO

Authors Rong-Hong Jan, Lih-Hsing Hsu, Yueh-Ying Lee

Publication date 16 January 1993

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02074877

zbMATH Keywords

most vital edge setspanning treestwo-terminal series-parallel graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The most vital edges in the minimum spanning tree problem
• Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
• On the number of spanning trees in graphs with multiple edges
• Finding the k most vital edges with respect to minimum spanning tree
• scientific article; zbMATH DE number 1444314
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs
• Efficient determination of the k most vital edges for the minimum spanning tree problem
• Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗
• Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
• Spanning trees in random series-parallel graphs

Cites work

• A note on the tour problems in two-terminal series-parallel graphs
• Determining the most vital link in a flow network
• Finding the most vital arcs in a network
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Most vital links and nodes in weighted networks
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Steiner trees, partial 2–trees, and minimum IFI networks
• The Recognition of Series Parallel Digraphs
• Topology of series-parallel networks

Cited in

(1)

• An efficient parallel strategy for computing \(K\)-terminal reliability and finding most vital edges in 2-trees and partial 2-trees

This page was built for publication: The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs

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