Abstract
We define two algebra-based algorithms for solving the Minimum Spanning Tree problem with partially-ordered edges. The parametric structure we propose is a c-semiring, being able to represent different cost-metrics at the same time. We embed c-semirings into the Kruskal and Reverse-delete Kruskal algorithms (thus generalising them), and we suppose the edge costs to be partially ordered. C-semirings can represent multi-criteria MST problems, which are NP-hard to solve. Finally, we test one of the new algorithms to prove its applicability in practice, and we compare it with related work.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.