The 1-Center Problem: Exploiting Block Structure
From MaRDI portal
Publication:3818093
DOI10.1287/trsc.22.4.259zbMath0665.90026MaRDI QIDQ3818093
No author found.
Publication date: 1988
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.22.4.259
tree; block of a graph; maximal nonseparable subgraph; blocking graph; nonlinear 1-center problem on graphs
Related Items
A minimum length covering subgraph of a network, Locating an absolute center on graphs that are almost trees, Efficient algorithms for center problems in cactus networks