Global preferential consistency for the topological sorting-based maximal spanning tree problem

TL;DR

This paper introduces preferential consistency problems for maximal spanning trees, offering a new compact preference representation, comparing it with multiobjective problems, and proposing an efficient solving algorithm.

Contribution

It presents a novel preferential consistency framework for spanning trees, including a compact preference representation and an efficient solution algorithm.

Findings

New compact preference representation for spanning trees

Comparison with Pareto-based multiobjective problems

Efficient algorithm for preferential consistency problem

Abstract

We introduce a new type of fully computable problems, for DSS dedicated to maximal spanning tree problems, based on deduction and choice: preferential consistency problems. To show its interest, we describe a new compact representation of preferences specific to spanning trees, identifying an efficient maximal spanning tree sub-problem. Next, we compare this problem with the Pareto-based multiobjective one. And at last, we propose an efficient algorithm solving the associated preferential consistency problem.