Algebraic Investigation of Connected Components
From MaRDI portal
Publication:5283206
DOI10.1007/978-3-319-57418-9_7zbMath1486.68100OpenAlexW2608902746WikidataQ62039031 ScholiaQ62039031MaRDI QIDQ5283206
Publication date: 21 July 2017
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57418-9_7
Semantics in the theory of computing (68Q55) Connectivity (05C40) De Morgan algebras, ?ukasiewicz algebras (lattice-theoretic aspects) (06D30) Structure theory of Boolean algebras (06E05)
Related Items (3)
Components and acyclicity of graphs. An exercise in combining precision with concision ⋮ Isolated sublattices and their application to counting closure operators ⋮ Relational characterisations of paths
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cardinality of relations with applications
- A strong-connectivity algorithm and its applications in data flow analysis
- Varieties of lattices
- An algebraic formalization of fuzzy relations
- A completeness theorem for Kleene algebras and the algebra of regular events
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- A lattice-theoretical fixpoint theorem and its applications
- Cardinalities of Finite Relations in Coq
- Point Axioms in Dedekind Categories
- Interacting with Modal Logics in the Coq Proof Assistant
- Investigating and Computing Bipartitions with Algebraic Means
- Tool-Based Verification of a Relational Vertex Coloring Program
- Quantales and Temporal Logics
- A Semiring Approach to Equivalences, Bisimulations and Control
- Kleene algebra with domain
- On the Cardinality of Relations
This page was built for publication: Algebraic Investigation of Connected Components
