A linear-time algorithm for solving the center problem on weighted cactus graphs
Authors:
- Yu-Feng LanYLYu-Feng Lan
- Yue-Li WangYWYue-Li Wang
- Hitoshi SuzukiHSHitoshi Suzuki
- 1 September 1999
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 71 (5-6) , 205-212
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- An optimal parallel algorithm for computing furthest neighbors in a treeInformation Processing Letters, 1992
- Locating an absolute center on graphs that are almost treesEuropean Journal of Operational Research, 1990
- Block-vertex duality and the one-median problemNetworks, 1985
- Distributed algorithms for finding centers and medians in networksACM Transactions on Programming Languages and Systems, 1984
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location ProblemsJournal of the ACM, 1984
- Economic Evaluation of Loop Feeder Relief AlternativesBell System Technical Journal, 1980
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930