Computing

, Volume 60, Issue 2, pp 109–119

Spanning trees and shortest paths in monge graphs

  • T. Dudás
  • R. Rudolf
Article

DOI: 10.1007/BF02684360

Cite this article as:
Dudás, T. & Rudolf, R. Computing (1998) 60: 109. doi:10.1007/BF02684360

Abstract

We investigate three problems onMonge graphs, i.e. complete, undirected weighted graphs whose distance matrix is a Monge matrix: (A) the minimum spanning tree problem, (B) the problem of computing all-pairs shortest paths and (C) the problem of determining a minimum weighted 1-to-all shortest path tree. For all three problems best possible algorithms (in terms of complexity) are presented.

AMS Subject Classifications

90C2705C5005C0505C12

Key words

Minimum spanning treeMonge matrixshortest paths

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • T. Dudás
    • 1
  • R. Rudolf
    • 1
  1. 1.Institut für Mathematik B GrazGrazAustria