Components and acyclicity of graphs. An exercise in combining precision with concision

• Published in: Journal of logical and algebraic methods in programming Vol. 124; p. 100730
• Main Authors: Backhouse, Roland, Doornbos, Henk, Glück, Roland, van der Woude, Jaap
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.01.2022
• Subjects: Acyclic graph; Calculational method; Point-free reasoning; Regular algebra; Relation algebra; Strongly connected component; Relation algebra; Strongly connected component; Calculational method; Regular algebra; Acyclic graph; Point-free reasoning

Central to algorithmic graph theory are the concepts of acyclicity and strongly connected components of a graph, and the related search algorithms. This article is about combining mathematical precision and concision in the presentation of these concepts. Concise formulations are given for, for exam...