AI Chat AI Image Generator AI Video Text to Speech

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

03/29/2012

∙

by Rémy-Robert Joseph, et al.

∙

∙

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.

research

∙ 09/12/2022

QUBO formulations for NP-Hard spanning tree problems

We introduce a novel Quadratic Unconstrained Binary Optimization (QUBO) ...

0 Ivan Carvalho, et al. ∙

research

∙ 04/19/2020

Planar Bichromatic Bottleneck Spanning Trees

Given a set P of n red and blue points in the plane, a planar bichromati...

0 A. Karim Abu-Affash, et al. ∙

research

∙ 03/02/2015

Grouping and Recognition of Dot Patterns with Straight Offset Polygons

When the boundary of a familiar object is shown by a series of isolated ...

0 Toshiro Kubota, et al. ∙

research

∙ 05/31/2023

On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem

We contribute to the efficient approximation of the Pareto-set for the c...

0 Jakob Bossek, et al. ∙

research

∙ 02/25/2021

Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate

We consider determinantal point processes (DPPs) constrained by spanning...

0 Tatsuya Matsuoka, et al. ∙

research

∙ 01/28/2022

Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable

An arc-colored tournament is said to be k-spanning for an integer k≥ 1 i...

0 Vikraman Arvind, et al. ∙

research

∙ 11/03/2022

Distributed Reconfiguration of Spanning Trees

In a reconfiguration problem, given a problem and two feasible solutions...

0 Siddharth Gupta, et al. ∙