Abstract
Algorithms consisting of repetitive change to a given graph are described in a manner adapted to graph theoretic applications. Easily provable attributes are defined, a sufficient criterion for the finite Church-Rosser property is given, and it is shown how this property can be proved by using a simple set oriented Boolean matrix calculus. As an application a new and efficient algorithm for finding the interval graph of a flow graph is derived.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
A.V. Aho, Ravi Sethi, J.D. Ullman: Code optimization and finite Church-Rosser systems Princeton University, Electrical Engineering Department, New Jersey, T.R. 92, April 1971
Alfred V. Aho, Jeffrey D. Ullman: The theory of parsing, translation, and compiling Volume II: Compiling Englewood Cliffs, N.J., Prentice-Hall, 1973
F.E. Allen: Control flow analysis SIGPLAN Notices 5 (1970), 1–19
F.E. Allen, J. Cocke: A program data flow analysis procedure Comm. ACM 19 (1976), 137–147
Walter Bosse: Einführung in das Programmieren mit ALGOL W Mannheim, Bibliographisches Institut, HTB 784, 1976
Jürgen Ebert: Operator-Algorithmen auf Matrizen-Darstellungen von Graphen Universität Münster, Rechenzentrum, Schriftenreihe Nr. 25, 1977
Matthew S. Hecht, Jeffrey D. Ullman: Flow graph reducibility SIAM J. Comput. 1 (1972), 188–202
Donald E. Knuth: The art of Computer programming Volume I: fundamental algorithms, New York, Addison-Wesley, 1974, 2. Auflage
Stephen Warshall: A theorem on Boolean matrices Journal ACM 9 (1962), 11–12
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer Basel AG
About this chapter
Cite this chapter
Ebert, J. (1979). Endliche Church-Rosser-Operatoren auf Graphen und ein Intervall-Algorithmus. In: Collatz, L., Meinardus, G., Wetterling, W. (eds) Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale D’Analyse Numérique, vol 46. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5997-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-0348-5997-4_4
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-1078-3
Online ISBN: 978-3-0348-5997-4
eBook Packages: Springer Book Archive