Components and acyclicity of graphs. An exercise in combining precision with concision
From MaRDI portal
Recommendations
Cites work
- A calculational approach to mathematical induction
- A comparison of gaussian and gauss-jordan elimination in regular algebra
- Algebraic investigation of connected components
- An analysis of repeated graph search
- Calculating path algorithms
- Demonic operators and monotype factors
- Efficient string matching
- Factor theory and the unity of opposites
- Fast Pattern Matching in Strings
- Fixed-point calculus
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 3550201 (Why is no real title available?)
- scientific article; zbMATH DE number 977284 (Why is no real title available?)
- scientific article; zbMATH DE number 2087342 (Why is no real title available?)
- scientific article; zbMATH DE number 890353 (Why is no real title available?)
- scientific article; zbMATH DE number 1434122 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Programming from metaphorisms
- Regular algebra applied to language problems
- Regular Algebra Applied to Path-finding Problems
- Relations binaires, fermetures, correspondances de Galois
- Roots of Star Events
- The loop complexity of pure-group events
Cited in
(4)
This page was built for publication: Components and acyclicity of graphs. An exercise in combining precision with concision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667191)