scientific article
From MaRDI portal
Publication:4041054
zbMath0705.68083MaRDI QIDQ4041054
Gunther Schmidt, Thomas Ströhlein
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of graph theory (05C90) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Other classical set theory (including functions, relations, and set algebra) (03E20) Discrete mathematics in relation to computer science (68R99)
Related Items (34)
Relations as Images ⋮ Stone Relation Algebras ⋮ A relational division operator: The conjugate kernel ⋮ An algebraic approach to computations with progress ⋮ Cryptomorphic topological structures: a computational, relation-algebraic approach ⋮ Normal design algebra ⋮ Relation Algebras, Matrices, and Multi-valued Decision Diagrams ⋮ Relational Concepts in Social Choice ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Imperative abstractions for functional actions ⋮ Cardinality functions in allegories ⋮ A Relation-Algebraic Approach to Multirelations and Predicate Transformers ⋮ Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Partiality. II: Constructed relation algebras ⋮ Lazy Relations ⋮ Cardinality in Allegories ⋮ Rectangles, Fringes, and Inverses ⋮ An Ordered Category of Processes ⋮ Multirelations with infinite computations ⋮ Hopscotch -- reaching the target hop by hop ⋮ Dependences between domain constructions in heterogeneous relation algebras ⋮ Choices and kernels in bipolar valued digraphs ⋮ Second-order properties of undirected graphs ⋮ Relational measures and integration in preference modeling ⋮ Products in categories of relations ⋮ Embedding a demonic semilattice in a relation algebra ⋮ An algebraic approach to multirelations and their properties ⋮ Verifying minimum spanning tree algorithms with Stone relation algebras ⋮ Embedding mappings and splittings with applications ⋮ Fixpoints for general correctness ⋮ Membership values in arrow categories ⋮ Unnamed Item ⋮ On fuzzification of some concepts of graphs ⋮ Infinite executions of lazy and strict computations
This page was built for publication:
