A note on two problems in connexion with graphs

  title={A note on two problems in connexion with graphs},
  author={E. Dijkstra},
  journal={Numerische Mathematik},
  • E. Dijkstra
  • Published 1959
  • Computer Science, Mathematics
  • Numerische Mathematik
  • We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between the n nodes. (A tree is a graph with one and only one path between every two nodes.) In the course of the construction that we present here, the branches are subdivided into three sets: I. the… CONTINUE READING
    18,906 Citations

    Topics from this paper.

    The shortest-path problem for graphs with random arc-lengths
    • 269
    • PDF
    All pairs lightest shortest paths
    • 10
    Shortest Path Problems with Time Constraints
    • 7
    Shortest Shortest Path Trees of a Network
    • 4
    Algebraic theory on shortest paths for all flows
    • T. Takaoka
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2019
    On Shortest Disjoint Paths in Planar Graphs
    • 35
    • PDF
    Some Extensions of the Bottleneck Paths Problem
    • 5
    Sharing Information in All Pairs Shortest Path Algorithms
    • 3
    • PDF
    Variations on the bottleneck paths problem
    • 2


    • 517
    Mathematisch Centrum 2e Boerhaavestraat 49 Amsterdam-O (Received ]1tne 11, 19:WJ Druck tier Univ,,rsitiitstlruckerei II
    • Theorie des graphes et ses applications,
    • 1958
    I heorie des graphes et ses applications, pp. 6g _ 69. paris: Dunod t 95g
    • Mattreoatisch Centlum 2e Boerhaavestraat 49 Amsterdam-O (Recefued
    • 1959
    Théorie des graphes et ses applications
    • 422
    VVEINBERGER: Formal Procedures for Connecting Terminals with a Minimum Total ,vire Length
    • J. Ass. Comp. Mach
    • 1957
    WETNaERGER : Formal procedures ior Co " nJciiog ferminals with a Minimum Total Wire Length
    • J . Ass . Comp . Macb . I heorie des graphes et ses applications Mattreoatisch Centlum 2 e Boerhaavestraat 49 AmsterdamO ( Recefued