An algorithm for finding the absolute center of a network
From MaRDI portal
Recommendations
Cites work
- A polynomial time algorithm for finding the absolute center of a network
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- scientific article; zbMATH DE number 3847184 (Why is no real title available?)
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
Cited in
(14)- Group centre and group median of a network
- Some new algorithms for location problems on networks
- Location and layout planning. A survey
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
- scientific article; zbMATH DE number 4179135 (Why is no real title available?)
- scientific article; zbMATH DE number 4095237 (Why is no real title available?)
- A polynomial time algorithm for finding the absolute center of a network
- Biobjective center – balance graph location model*
- The absolute center of a network
- scientific article; zbMATH DE number 1786155 (Why is no real title available?)
- Using weighted graphs features for fast searching their parameters
- Discrete center problems
- The continuous center set of a network
- The absolute centre of a graph
This page was built for publication: An algorithm for finding the absolute center of a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173797)