Locating an absolute center on graphs that are almost trees

DOI10.1016/0377-2217(90)90247-9zbMath0687.90032OpenAlexW2017278290MaRDI QIDQ1263510

Rex K. Kincaid, Timothy J. Lowe

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90247-9

zbMATH Keywords

linear time algorithmlocationtelecommunication networksabsolute center problem3-cactus graphtreelike graph structure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05)

Related Items

The location of central structures in trees ⋮ An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs ⋮ Discrete Center Problems ⋮ Exploiting Structure: Location Problems on Trees and Treelike Graphs ⋮ A linear-time algorithm for solving the center problem on weighted cactus graphs

Cites Work

• Applications of algebraic topology. Graphs and networks. The Picard- Lefschetz theory and Feynman integrals
• Parallel concepts in graph theory
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• The 1-Center Problem: Exploiting Block Structure
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Finding kth paths and p-centers by generating and searching good data structures
• Depth-First Search and Linear Graph Algorithms
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item