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

DOI10.1016/0305-0548(90)90008-UzbMATH Open0699.90030OpenAlexW2086549592MaRDI QIDQ913638FDOQ913638

Authors: Oded 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

Recommendations

• The 2-median problem on cactus graphs with positive and negative weights
• scientific article; zbMATH DE number 1786156
• Centdian computation in cactus graphs
• Median problems on wheels and cactus graphs
• scientific article; zbMATH DE number 4173027

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)

Cites Work

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

Cited In (4)

• Improved algorithms for several network location problems with equality measures.
• Finding a central vertex in an HHD-free graph
• The maximum absolute deviation measure in location problems on networks
• The Variance Location Problem on a Network with Continuously distributed demand

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913638)