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

DOI10.1016/j.jlamp.2021.100730zbMath1481.68034OpenAlexW3206621927MaRDI QIDQ2667191

Jaap van der Woude, Henk Doornbos, Roland Glück, Roland C. Backhouse

Publication date: 24 November 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100730

zbMATH Keywords

relation algebraacyclic graphstrongly connected componentcalculational methodregular algebrapoint-free reasoning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On difunctions

Cites Work

• Fixed-point calculus
• Regular algebra applied to language problems
• Calculating path algorithms
• A calculational approach to mathematical induction
• Programming from metaphorisms
• An analysis of repeated graph search
• Factor theory and the unity of opposites
• A comparison of gaussian and gauss-jordan elimination in regular algebra
• Efficient string matching
• Regular Algebra Applied to Path-finding Problems
• Fast Pattern Matching in Strings
• Demonic operators and monotype factors
• Algebraic Investigation of Connected Components
• Roots of Star Events
• The loop complexity of pure-group events
• Relations binaires, fermetures, correspondances de Galois
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Components and acyclicity of graphs. An exercise in combining precision with concision