Self-Correlation and Maximum Independence in Finite Relations
We consider relations with no order on their attributes as in Database Theory. An independent partition of the set of attributes S of a finite relation R is any partition X of S such that the join of the projections of R over the elements of X yields R. Identifying independent partitions has many a...
Main Authors: | Dilian Gurov, Minko Markov |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2015-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1509.03016v1 |
Similar Items
-
Specification and verification of communicating systems with value passing
by: Gurov, Dilian Borissov
Published: (2017) -
Structural solutions to maximum independent set and related problems
by: Dabrowski, Konrad K.
Published: (2012) -
A fast practical algorithm for the vertex separation of unicyclic graphs
by: Markov, Minko Marinov.
Published: (2008) -
On the number of maximum independent sets of graphs
by: Tajedin Derikvand, et al.
Published: (2014-03-01) -
Algorithms for the Maximum Independent Set Problem
by: Lê, Ngoc C.
Published: (2015)