An algebraic framework for minimum spanning tree problems
type: Item
instance of: scholarly article
title: An algebraic framework for minimum spanning tree problems
zbMATH Open document ID: 1401.68246
author: Walter Guttmann
published in: Theoretical Computer Science
publication date: 2018-09-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 6942949
zbMATH Keywords: aggregation
zbMATH Keywords: correctness proof
zbMATH Keywords: formal methods
zbMATH Keywords: Kleene algebras
zbMATH Keywords: relations
zbMATH Keywords: Stone algebras
zbMATH Keywords: weighted graphs
describes a project that uses: Archive Formal Proofs
describes a project that uses: Algorithm 97
describes a project that uses: RelView
describes a project that uses: Isabelle/HOL
describes a project that uses: HOL
describes a project that uses: Relation Algebra
describes a project that uses: Kleene Algebra
describes a project that uses: Isabelle
describes a project that uses: Sledgehammer
describes a project that uses: Stone Algebras
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.04.012
OpenAlex ID: W2802771107
cites work: Q4436983
cites work: Q4091421
cites work: Regular Algebra Applied to Path-finding Problems
cites work: Absorbent tuples of aggregation operators
cites work: Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
cites work: Computing tournament solutions using relation algebra and RelView
cites work: Q4362882
cites work: Q4213376
cites work: Q4331824
cites work: Q5331549
cites work: C-semiring Frameworks for Minimum Spanning Tree Problems
cites work: Extending Sledgehammer with SMT Solvers
cites work: Lattices and ordered algebraic structures
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: Totally ordered commutative semigroups
cites work: Q4273425
cites work: Q5639639
cites work: Q3619797
cites work: Q5565113
cites work: Relational style laws and constructs of linear algebra
cites work: A note on two problems in connexion with graphs
cites work: Q3995720
cites work: L-fuzzy sets
cites work: Graphs, dioids and semirings. New models and algorithms.
cites work: Q3639652
cites work: On the History of the Minimum Spanning Tree Problem
cites work: Q5639727
cites work: Theory of T-norms and fuzzy inference methods
cites work: Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm
cites work: Stone Relation Algebras
cites work: The verified incremental design of a distributed spanning tree algorithm: Extended abstract
cites work: Dijkstra, Floyd and Warshall meet Kleene
cites work: On the Cardinality of Relations
cites work: Crispness in Dedekind categories
cites work: Categorical representation theorems of fuzzy relations
cites work: Relations among Matrices over a Semiring
cites work: Q4398780
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: A linear algebra approach to OLAP
cites work: Relation-algebraic semantics
cites work: The saga of minimum spanning trees
cites work: Winskel is (almost) right: Towards a mechanized semantics textbook
cites work: Q4823141
cites work: Concrete Semantics
cites work: Isabelle/HOL. A proof assistant for higher-order logic
cites work: Extended Static Checking by Calculation Using the Pointfree Transform
cites work: Towards a linear algebra of programming
cites work: WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES

An algebraic framework for minimum spanning tree problems (cites work)
cites work: Q3703918

An algebraic framework for minimum spanning tree problems (cites work)
cites work: Abstract abstract reduction

An algebraic framework for minimum spanning tree problems (cites work)
cites work: A Theorem on Boolean Matrices

An algebraic framework for minimum spanning tree problems (cites work)
cites work: A new algebraic approach to L-fuzzy relations convenient to study crispness

An algebraic framework for minimum spanning tree problems (Wikidata QID)
Wikidata QID: Q128988457

An algebraic framework for minimum spanning tree problems (DOI)
DOI: 10.1016/J.TCS.2018.04.012