Finding All Maximal Cliques in Dynamic Graphs
نویسندگان
چکیده
منابع مشابه
Finding All Maximal Cliques in Dynamic Graphs
Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like Gt = (V,Et), where Et−1 ⊂ Et, t = 1, . . . , T ;E0 = φ. In thi...
متن کاملFinding All Maximal Cliques in Very Large Social Networks
The detection of communities in social networks is a challenging task. A rigorous way to model communities considers maximal cliques, that is, maximal subgraphs in which each pair of nodes is connected by an edge. State-of-the-art strategies for finding maximal cliques in very large networks decompose the network in blocks and then perform a distributed computation. These approaches exhibit a t...
متن کاملFinding All Maximal Connected s-Cliques in Social Networks
Cliques are commonly used for social network analysis tasks, as they are a good representation of close-knit groups of people. For this reason (as well as for others), the problem of enumerating, i.e., finding, all maximal cliques in a graph has received extensive treatment. However, considering only complete subgraphs is too restrictive in many real-life scenarios where “almost cliques” may be...
متن کاملOn Effectively Finding Maximal Quasi-cliques in Graphs
The problem of finding a maximum clique in a graph is prototypical for many clustering and similarity problems; however, in many real-world scenarios, the classical problem of finding a complete subgraph needs to be relaxed to finding an almost complete subgraph, a so-called quasi-clique. In this work, we demonstrate how two previously existing definitions of quasi-cliques can be unified and ho...
متن کاملFinding All Maximal Cliques of a Family of Induced Subgraphs
Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects, find maximal subsets whose elements mutually satisfy this relation. This problem can be transformed to the problem of finding all cliques of an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2004
ISSN: 0926-6003
DOI: 10.1023/b:coap.0000008651.28952.b6