An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Corrections to Bierstone's Algorithm for Generating Cliques
Journal of the ACM (JACM)
Programming faults and errors: Towards a theory of software incorrectness
Annals of Software Engineering
New developments for determinacy analysis: diclique-based approach
WSEAS Transactions on Information Science and Applications
Determinacy analysis as a diclique extracting task
ECC'08 Proceedings of the 2nd conference on European computing conference
Rectangles, fringes, and inverses
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Machine learning task as a diclique extracting task
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
Towards a formal concept analysis approach to exploring communities on the world wide web
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
| Hi-index | 0.00 |
The binary relation is often a useful mathematical structure for representing simple relationships whose essence is a directed connection. To better aid in interpreting or storing a binary relation we suggest a diclique decomposition. A diclique of a binary relation R is defined as an ordered pair (I, O) such that I × O ⊆ R and (I, O) is maximal. In this paper, an algorithm is described for determining the dicliques of a binary relation; it is proved that the set of such dicliques has a nice algebraic structure. The algebraic structure is used to show how dicliques can be coalesced, the relationship between cliques and dicliques is discussed, and an algorithm for determining cliques from dicliques is described.