Majority graphs of profiles of equivalence relations and complexity of Régnier’s problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Majority graphs of profiles of equivalence relations and complexity of Régnier’s problem

(1, 2)
1
2

Abstract

A classic problem arising in classication consists in summarizing a collection C, called a profile, of p equivalence relations defined on a finite set X by an equivalence relation E* at minimum remoteness from C. The remoteness is based on the symmetric dierence distance and measures the total number of disagreements between E* and C, and then E* is called a median equivalence relation of C. It is usual to summarize C by its majority graph. We study the converse issue. We give a sufficient condition for a graph to be the majority graph of a profile of equivalence relations. We then deduce from this that the computation of E* is NP-hard when p is large enough.
Not file

Dates and versions

hal-02286316 , version 1 (13-09-2019)

Identifiers

  • HAL Id : hal-02286316 , version 1

Cite

Olivier Hudry. Majority graphs of profiles of equivalence relations and complexity of Régnier’s problem. 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), May 2012, Munich, Germany. pp.147-150. ⟨hal-02286316⟩
44 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More