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

DOI10.1007/BF02074877zbMath0752.68062MaRDI QIDQ1198968

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

Publication date: 16 January 1993

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

spanning treestwo-terminal series-parallel graphsmost vital edge set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Most vital links and nodes in weighted networks
• A note on the tour problems in two-terminal series-parallel graphs
• Finding the most vital arcs in a network
• Topology of series-parallel networks
• Steiner trees, partial 2–trees, and minimum IFI networks
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• The Recognition of Series Parallel Digraphs
• Determining the most vital link in a flow network

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