A note on locating a central vertex of a 3-cactus graph

DOI10.1016/0305-0548(90)90008-UzbMath0699.90030OpenAlexW2086549592MaRDI QIDQ913638

Oded Z. Maimon, Rex K. Kincaid

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90008-u

zbMATH Keywords

treelocationlinear time algorithms3- cactus networkminimum weighted vertex variance problemstochastic queue median problemvertex-weighted networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Queues and service in operations research (90B22) Inventory, storage, reservoirs (90B05)

Related Items (3)

Improved algorithms for several network location problems with equality measures. ⋮ The maximum absolute deviation measure in location problems on networks ⋮ The Variance Location Problem on a Network with Continuously distributed demand

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Optimal Server Location on a Network Operating as an M/G/1 Queue
• Locating a Mobile Server Queueing Facility on a Tree Network
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• Block-vertex duality and the one-median problem
• Technical Note—The Stochastic Queue Median Over a Finite Discrete Set
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A note on locating a central vertex of a 3-cactus graph