Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

An algorithm for finding a minimal equivalent graph of a strongly connected digraph

Ein Algorithmus, der zu einem stark zusammenhängenden Digraph einen äquivalenten kantenminimalen Digraph bestimmt

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The paper presents a new branch and bound algorithm for removing the maximum number of edges from a strongly connected digraph without affecting its reachability properties.

A FORTRAN IV implementation is given.

The efficiency of the algorithm is analyzed through computational comparison with the methods of Moyles-Thompson and Hsu.

Zusammenfassung

Es wird ein neuer Branch-and-Bound-Algorithmus vorgestellt, der aus einem stark zusammenhängenden Digraphen eine maximale Anzahl von Kanten entfernt, ohne die Zusammenhangsverhältnisse zu verändern.

Eine FORTRAN IV Version des Algorithmus ist beigefügt.

Das Verhalten des Algorithmus wird durch Abschätzung der Komplexität und durch Vergleich mit den Algorithmen von Moyles-Thompson und Hsu verdeutlicht.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Hsu, H. T.: An Algorithm for Finding a Minimal Equivalent Graph of a Digraph. Journal of ACM22 (1975).

  2. Moyles, D. M., Thompson, G. L.: An Algorithm for Finding a Minimum Equivalent Graph of a Digraph. Journal of ACM16 (1969).

  3. Yen, J. Y.: Finding the Lengths of all Shortest Paths inN-Node Nonnegative Distance Complete Networks Using 1/2N 3 Additions andN 3 Comparisons. Journal of ACM19 (1972).

Download references

Author information

Authors and Affiliations

  1. Istituto di Automatica, University of Bologna, Viale Risorgimento, 2, I-40136, Bologna, Italy

    S. Martello

Authors
  1. S. Martello
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martello, S. An algorithm for finding a minimal equivalent graph of a strongly connected digraph. Computing 21, 183–194 (1979). https://doi.org/10.1007/BF02253052

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02253052

Keywords

Search

Navigation