C-semiring Frameworks for Minimum Spanning Tree Problems

DOI10.1007/978-3-642-03429-9_5zbMath1253.68370OpenAlexW1788771336MaRDI QIDQ3184724

Francesco Santini, Stefano Bistarelli

Publication date: 22 October 2009

Published in: Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03429-9_5

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm ⋮ Verifying minimum spanning tree algorithms with Stone relation algebras ⋮ An algebraic framework for minimum spanning tree problems ⋮ Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs

Cites Work

• Unnamed Item
• Unnamed Item
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
• Semirings for constraint solving and programming.
• A new proof of Cayley's formula for counting labeled trees
• Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
• Semiring-based constraint satisfaction and optimization
• Soft constraint logic programming and generalized shortest path problems

This page was built for publication: C-semiring Frameworks for Minimum Spanning Tree Problems