Algebraic investigation of connected components

DOI10.1007/978-3-319-57418-9_7MaRDI QIDQ5283206zbMATH OpenOpenAlexWikidataFDO

Authors Roland Glück

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

Mathematics Subject Classification ID

Connectivity (05C40) De Morgan algebras, ?ukasiewicz algebras (lattice-theoretic aspects) (06D30) Structure theory of Boolean algebras (06E05) Semantics in the theory of computing (68Q55)

Recommendations

• Components and acyclicity of graphs. An exercise in combining precision with concision
• Enumeration of connected components of acyclic digraph
• Connected components and evolution of random graphs: An algebraic approach
• Connected components and minimum paths
• Static and dynamic parallel computation of connected components

Cites work

• A completeness theorem for Kleene algebras and the algebra of regular events
• A lattice-theoretical fixpoint theorem and its applications
• A semiring approach to equivalences, bisimulations and control
• A strong-connectivity algorithm and its applications in data flow analysis
• An algebraic formalization of fuzzy relations
• Cardinalities of Finite Relations in Coq
• Cardinality of relations with applications
• Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
• scientific article; zbMATH DE number 2163052 (Why is no real title available?)
• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• Interacting with Modal Logics in the Coq Proof Assistant
• Investigating and computing bipartitions with algebraic means
• Kleene algebra with domain
• On the Cardinality of Relations
• Point axioms in Dedekind categories
• Quantales and Temporal Logics
• Tool-Based Verification of a Relational Vertex Coloring Program
• Varieties of lattices

Cited in

(6)

• Relational characterisations of paths
• Components and acyclicity of graphs. An exercise in combining precision with concision
• Isolated sublattices and their application to counting closure operators
• Concurrent determination of connected components
• Isolated suborders and their application to counting closure operators
• The index and core of a relation. With applications to the axiomatics of relation algebra

Describes a project that uses

Uses Software

• Mace4
• Isabelle
• Prover9
• Coq

This page was built for publication: Algebraic investigation of connected components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283206)