Skip to main content
SpringerLink
Log in

A reduct-and-closure algorithm for graphs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 74))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, M. R. Garey, J. D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput., 1:2(1972), 131–137.

    Article  Google Scholar 

  2. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1974.

    Google Scholar 

  3. G. Birkhoff, Lattice theory, Amer. Math. Soc., vol. XXV (1967).

    Google Scholar 

  4. M. Demlová, J. Demel, V. Koubek, Several algorithms for finite algebras, to appear in FCT 1979.

    Google Scholar 

  5. M. J. Fischer, A. R. Meyer, Boolean matrix multiplication and transitive closure, IEEE 12th Annual Symposium on Switching and Automata Theory (1971), 129–131.

    Google Scholar 

  6. H. B. Hunt III, T. G. Szymanski, J. D. Ullman, Operations on sparse relations, Comm. ACM 20:3(1977), 172–176.

    Google Scholar 

  7. R. E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput.,1:2(1972), 146–160.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computational Centre, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czechoslovakia

    Alla Goralčíková & Václav Koubek

Authors
  1. Alla Goralčíková
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Václav Koubek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goralčíková, A., Koubek, V. (1979). A reduct-and-closure algorithm for graphs. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation