A note on two problems in connexion with graphs

  title={A note on two problems in connexion with graphs},
  author={Edsger W. Dijkstra},
  journal={Numerische Mathematik},
  • E. Dijkstra
  • Published 1 December 1959
  • Mathematics, Computer Science
  • 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… 
The shortest-path problem for graphs with random arc-lengths
All pairs lightest shortest paths
This work presents the following algorithms for exactly solving the AlI Pairs Lightest Shortest Paths (APLSP) problem for directed graphs with integer weights of small absolute value, and presents results obtained recently by the author for the APSP problem.
Shortest Shortest Path Trees of a Network
Shortest Path Problems with Time Constraints
A new version of the shortest path problem is studied, where all transit times b(e, u) are positive integers and zero waiting times are assumed, namely, waiting at any vertex is strictly prohibited.
Some Extensions of the Bottleneck Paths Problem
This work presents a combinatorial algorithm to solve the Single Source Shortest Paths for All Flows (SSSP-AF) problem in O(mn) worst case time, followed by an algorithm to solved the All Pairs Shortest paths for all Fl flows (APSP-af) problemIn \(O(\sqrt{t}n^{(\omega+9)/4})\) time.
Sharing Information in All Pairs Shortest Path Algorithms
Two improvements on time complexities of the all pairs shortest path (APSP) problem for directed graphs that satisfy certain properties are shown and a nearly acyclic graph is considered.
Variations on the bottleneck paths problem
On shortest disjoint paths in planar graphs
Sharing information for the all pairs shortest path problem
  • T. Takaoka
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2014
The shortest path with at most / nodes in each of the series/parallel clusters
This work studies two related constrained shortest path problems in which the nodes are partitioned into series/parallel clusters, and proposes efficient exact algorithms for solving both problems.


Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
Two methods for systematically selecting the shortest connections from a list of possible connections to obtain a minimum total wire length are presented, which will be called a minimum tree.
On the shortest spanning subtree of a graph and the traveling salesman problem
7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J.
Abstract : The labeling algorithm for the solution of maximal network flow problems and its application to various problems of the transportation type are discussed.
I heorie des graphes et ses applications, pp. 6g _ 69. paris: Dunod t 95g
  • Mattreoatisch Centlum 2e Boerhaavestraat 49 Amsterdam-O (Recefued
  • 1959
VVEINBERGER: Formal Procedures for Connecting Terminals with a Minimum Total ,vire Length
  • J. Ass. Comp. Mach
  • 1957
Mathematisch Centrum 2e Boerhaavestraat 49 Amsterdam-O (Received ]1tne 11, 19:WJ Druck tier Univ,,rsitiitstlruckerei II
  • Theorie des graphes et ses applications,
  • 1958
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