Faster and Simpler Minimal Conflicting Set Identification

Details Faster and Simpler Minimal Conflicting Set Identification Faster and Simpler Minimal Conflicting Set Identification

2012-01-26

arxiv.org/abs/1201.5513v1

Computer Science

Data Structures and Algorithms

Scientific paper

Let C be a finite set of N elements and R = r_1,r_2,..., r_m a family of M subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each r_i in X is an interval of P. A Minimal Conflicting Set (MCS) S is a subset of R that does not verify the C1P, but such that any of its proper subsets does. In this paper, we present a new simpler and faster algorithm to decide if a given element r in R belongs to at least one MCS. Our algorithm runs in O(N^2M^2 + NM^7), largely improving the current O(M^6N^5 (M+N)^2 log(M+N)) fastest algorithm of [Blin {\em et al}, CSR 2011]. The new algorithm is based on an alternative approach considering minimal forbidden induced subgraphs of interval graphs instead of Tucker matrices.

Affiliated with

Also associated with

No associations

Rating

Faster and Simpler Minimal Conflicting Set Identification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faster and Simpler Minimal Conflicting Set Identification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster and Simpler Minimal Conflicting Set Identification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445624