Algebraic investigation of connected components
DOI10.1007/978-3-319-57418-9_7zbMATH Open1486.68100OpenAlexW2608902746WikidataQ62039031 ScholiaQ62039031MaRDI QIDQ5283206FDOQ5283206
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
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
Connectivity (05C40) Structure theory of Boolean algebras (06E05) Semantics in the theory of computing (68Q55) De Morgan algebras, ?ukasiewicz algebras (lattice-theoretic aspects) (06D30)
Cites Work
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A strong-connectivity algorithm and its applications in data flow analysis
- An algebraic formalization of fuzzy relations
- A completeness theorem for Kleene algebras and the algebra of regular events
- Quantales and Temporal Logics
- Kleene algebra with domain
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- Varieties of lattices
- A semiring approach to equivalences, bisimulations and control
- On the Cardinality of Relations
- Point Axioms in Dedekind Categories
- Title not available (Why is that?)
- Interacting with Modal Logics in the Coq Proof Assistant
- Tool-Based Verification of a Relational Vertex Coloring Program
- Cardinality of relations with applications
- Investigating and Computing Bipartitions with Algebraic Means
- Cardinalities of Finite Relations in Coq
Cited In (5)
- Isolated suborders and their application to counting closure operators
- Relational characterisations of paths
- Concurrent determination of connected components
- Components and acyclicity of graphs. An exercise in combining precision with concision
- Isolated sublattices and their application to counting closure operators
Uses Software
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)
