On the interchange heuristic for locating centers and medians in a graph
Ján Plesník (1987)
Mathematica Slovaca
Similarity:
Displaying similar documents to “A Note on the p−Center Problem”
On the interchange heuristic for locating centers and medians in a graph
Shields-Harary numbers of graphs with respect to continuous concave cost functions.
Holliday, John, Johnson, Peter (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A factor-two approximation algorithm for two-dimensional phase unwrapping.
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
Similarity:
Irregularity strength of regular graphs.
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Crossing numbers and cutwidths.
Djidjev, Hristo N., Vrt'o, Imrich (2003)
Journal of Graph Algorithms and Applications
Similarity:
Polar graphs and railway traffic
Bohdan Zelinka (1974)
Aplikace matematiky
Similarity: