Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- 1 July 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (3) , 379-389
- https://doi.org/10.1137/0607043
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Minimum cost flow algorithms for series-parallel networksDiscrete Applied Mathematics, 1985
- Finding kth paths and p-centers by generating and searching good data structuresJournal of Algorithms, 1983
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- Maximum flow in (s,t) planar networksInformation Processing Letters, 1981
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Optimal Center Location in Simple NetworksTransportation Science, 1971
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- A Property of 4-Chromatic Graphs and some Remarks on Critical GraphsJournal of the London Mathematical Society, 1952