Skip to main content
SpringerLink
Log in

Reachability

  • Chapter
Relations and Graphs

Part of the book series: EATCS Monographs on Theoretical Computer Science ((EATCS))

Abstract

In this chapter we focus once more on the transitive closure of relations In view of the applications we employ graph-theoretical language and speak of the reachability relation. In Sect. 6.1 we define paths and distinguish between paths in 1-graphs and paths in directed graphs. In the first case one considers points in the second, points and arcs. We define reachability in terms of paths, and discuss rooted graphs and strong connectedness. In Sect. 6.2 we discuss a similar close relationship between joinability, expressed in terms of chains, and connectedness.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6.6 References

  • Artin E: Theorie der Zöpfe. Abh. Math. Sem. Univ. Hamburg 4 (1926) 47–72.

    Article  Google Scholar 

  • Artin E: The theory of braids. Ann. of Math. (2) 48 (1947) 101–126.

    Article  MathSciNet  MATH  Google Scholar 

  • Berghammer R, Schnidt G: Discrete ordering relations. Discrete Math. 43 (1983) 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  • Church A, Rosser JB: Some properties of conversion. Trans. Amer. Math. Soc. 39 (1936) 472–482.

    Article  MathSciNet  Google Scholar 

  • Erné M: Einführung in die Ordnungstheorie. Bibliographisches Institut, Mannheim, 1982.

    MATH  Google Scholar 

  • Euwe M: Mengentheoretische Betrachtungen über das Schachspiel. Proc. Section of Sciences. Koninklijke Akad. van Wetensch. 32 (1929) 633–642.

    Google Scholar 

  • Felscher W, Schmidt J: Natürliche Zahlen, Ordnung, Nachfolge. Arch. Math. Logik Grundlagenforsch. 4 (1958) 81–94.

    Article  MathSciNet  MATH  Google Scholar 

  • Garside FA: The braid group and other groups. Quart. J. Math. 20 (1969) 235–254.

    Article  MathSciNet  MATH  Google Scholar 

  • Hermes H: Einführung in die Verbandstheorie. Springer, Berlin, 1955

    MATH  Google Scholar 

  • Hindley R: An abstract Church-Rosser theorem. II: Applications. J. Symbolic Logic 39 (1974) 1–21.

    Article  MathSciNet  MATH  Google Scholar 

  • Hitchcock P, Park D: Induction rules and termination proofs. In: Nivat M (ed.): Automata, languages and programming. Proc. of a Symp. organized by IRIA, July 3–7 1972, Rocquencourt, North-Holland Publ. Co., Amsterdam, 1973, 225–251.

    Google Scholar 

  • Huet G: Confluent reductions: Abstract properties and applications to term rewriting systems. J. Assoc. Comput. Mach. 27 (1980) 797–821.

    MathSciNet  MATH  Google Scholar 

  • Kalmár L: Zur Theorie der abstrakten Spiele. Acta Sci. Math. (Szeged) 4 (1928/29) 65–85.

    Google Scholar 

  • König D: Über eine Schlußweise aus dem Endlichen ins Unendliche. Acta Sci. Math. (Szeged) 3 (1927) 121–130.

    Google Scholar 

  • Langmaack H, Schmidt G: Klassen unwesentlich verschiedener Ableitungen als Verbände. In: Dörr J, Hotz G (eds.): Automatentheorie und formale Sprachen. Proc. Math. Forschungsinstitut Oberwolfach, 1969, Bibliographisches Institut, Mannheim, 1970, 169–182.

    Google Scholar 

  • Makanin GS: The conjugacy problem in the braid group. Soviet Math. Dokl. 9 (1968) 1156–1157.

    MATH  Google Scholar 

  • Menger K: Zur allgemeinen Kurventheorie. Fund. Math. 10 (1927) 96–115.

    MATH  Google Scholar 

  • Neumann J von, Morgenstern O: Theory of Games and Economic Behavior. Princeton Univ. Press., Princeton, N. J. (1944).

    MATH  Google Scholar 

  • Newman MHA: On theories with a combinatorial definition of “equivalence”. Ann. of Math. (2) 43 (1942) 223–243.

    Article  MathSciNet  MATH  Google Scholar 

  • Reidemeister K: Knotentheorie. Erg. der Math. 1 (1932).

    Google Scholar 

  • Schmidt G: Der Verband der Zöpfe. Abteilung Math. der Technischen Universität München, Bericht 6914, 1969.

    Google Scholar 

  • Staples J: Church-Rosser theorems for replacement systems. In: Crossley JN (ed.): Algebra and logic. Papers from the 1974 Summer Research Institute of the Australian Math. Soc. Monash Univ., Australia, Lecture Notes in Mathematics 450, Springer, Berlin, 1975, 291–307.

    Google Scholar 

  • Zermelo E: Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In: Proc. 5th International Congress Mathematics, Vol. II, Cambridge, 1912, 501–504.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, W-8014, Neubiberg, Germany

    Gunther Schmidt

  2. Fakultät für Informatik, Technische Universität München, Postfach 20 24 20, W-8000, München 2, Germany

    Thomas Ströhlein

Authors
  1. Gunther Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Ströhlein
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schmidt, G., Ströhlein, T. (1993). Reachability. In: Relations and Graphs. EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77968-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77968-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-77970-1

  • Online ISBN: 978-3-642-77968-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation