Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, M. R. Garey, J. D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput., 1:2(1972), 131–137.
A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1974.
G. Birkhoff, Lattice theory, Amer. Math. Soc., vol. XXV (1967).
M. Demlová, J. Demel, V. Koubek, Several algorithms for finite algebras, to appear in FCT 1979.
M. J. Fischer, A. R. Meyer, Boolean matrix multiplication and transitive closure, IEEE 12th Annual Symposium on Switching and Automata Theory (1971), 129–131.
H. B. Hunt III, T. G. Szymanski, J. D. Ullman, Operations on sparse relations, Comm. ACM 20:3(1977), 172–176.
R. E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput.,1:2(1972), 146–160.
Author information
Authors and Affiliations
Editor information
Rights 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