Finding all maximal cliques in dynamic graphs

Stix, Volker (2002) Finding all maximal cliques in dynamic graphs. Working Papers on Information Systems, Information Business and Operations, 02/2002. Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
document.pdf

Download (238kB)

Abstract

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 G_t=(V,E_t), where E_(t-1) in E_t, t=1,... ,T; E_0=(). In this article algorithms are provided to track all maximal cliques in a fully dynamic graph. It is naturally to raise the question about the maximum clique, having all maximal cliques. Therefore this article discusses potentials and drawbacks for this problem as well. (author's abstract)

Item Type: Paper
Keywords: maximal clique / dynamic graphs / fuzzy clustering
Divisions: Departments > Informationsverarbeitung u Prozessmanag. > Informationswirtschaft
Depositing User: Repository Administrator
Date Deposited: 27 Mar 2002 13:26
Last Modified: 22 Oct 2019 00:41
URI: https://epub.wu.ac.at/id/eprint/1198

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics