Maximal strongly connected cliques in directed graphs: Algorithms and bounds - Université Clermont Auvergne Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2021

Maximal strongly connected cliques in directed graphs: Algorithms and bounds

Résumé

Finding communities in the form of cohesive subgraphs is a fundamental problem in network analysis. In domains that model networks as undirected graphs, communities are generally associated with dense subgraphs, and many community models have been proposed. Maximal cliques are arguably the most widely studied among such models, with early works dating back to the ’60s, and a continuous stream of research up to the present. In domains that model networks as directed graphs, several approaches for community detection have been proposed, but there seems to be no clear model of cohesive subgraph, i.e., of what a community should look like. We extend the fundamental model of clique to directed graphs, adding the natural constraint of strong connectivity within the clique. We consider in this paper the problem of listing all maximal strongly connected cliques in a directed graph. We first investigate the combinatorial properties of strongly connected cliques and use them to prove that every -vertex directed graph has at most maximal strongly connected cliques. We then exploit these properties to produce the first algorithms with polynomial delay for enumerating maximal strongly connected cliques: a first algorithm with polynomial delay and exponential space usage, and a second one, based on reverse-search, with higher (still polynomial) delay but which uses linear space.1
Fichier non déposé

Dates et versions

hal-04056493 , version 1 (03-04-2023)

Identifiants

Citer

Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa. Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discrete Applied Mathematics, 2021, 303, pp.237-252. ⟨10.1016/j.dam.2020.05.027⟩. ⟨hal-04056493⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More