The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs
- 1 September 1992
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 32 (3) , 403-412
- https://doi.org/10.1007/bf02074877
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Finding the most vital arcs in a networkOperations Research Letters, 1989
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1983
- Most vital links and nodes in weighted networksOperations Research Letters, 1982
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965