Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RelView / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Archive Formal Proofs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-88701-8_14 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3209152073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4213376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing tournament solutions using relation algebra and RelView / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la liaison et la division des points d'un ensemble fini / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic framework for minimum spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying minimum spanning tree algorithms with Stone relation algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relation-algebraic view on evolutionary algorithms for some graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theorem for Kleene algebras and the algebra of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history / rank
 
Normal rank
Property / cites work
 
Property / cites work: Winskel is (almost) right: Towards a mechanized semantics textbook / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4823141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:47, 31 July 2024

scientific article
Language Label Description Also known as
English
Relation-algebraic verification of Borůvka's minimum spanning tree algorithm
scientific article

    Statements

    Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (English)
    0 references
    0 references
    30 March 2023
    0 references
    0 references
    algorithm verification
    0 references
    formal methods
    0 references
    Kleene algebras
    0 references
    relation algebras
    0 references
    stone algebras
    0 references
    weighted graphs
    0 references
    0 references