Algorithms for connected p-centdian problem on block graphs
- 13 July 2016
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 36 (1) , 252-263
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The connected p-center problem on block graphs with forbidden verticesTheoretical Computer Science, 2012
- A characterization of block graphsDiscrete Applied Mathematics, 2010
- Algorithms for central-median paths with bounded length on treesEuropean Journal of Operational Research, 2007
- The centdian subtree on tree networksDiscrete Applied Mathematics, 2002
- Algorithms for path medi-centers of a treeComputers & Operations Research, 1999
- From the median to the generalized centerRAIRO - Operations Research, 1991
- Block-vertex duality and the one-median problemNetworks, 1985
- Medi-Centers of a TreeTransportation Science, 1985
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a GraphManagement Science, 1978
- THE LOCATION OF A CENTER‐MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE*Journal of Regional Science, 1976