Maximal strongly connected cliques in directed graphs: algorithms and bounds
type: Item
instance of: scholarly article
title: Maximal strongly connected cliques in directed graphs: algorithms and bounds
zbMATH Open document ID: 1472.05061
author: Alessio Conte
author: Mamadou Moustapha Kanté
author: Takeaki Uno
author: Kunihiro Wasa
published in: Discrete Applied Mathematics
publication date: 2021-09-15T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7395743
zbMATH Keywords: enumeration algorithms
zbMATH Keywords: bounded delay
zbMATH Keywords: directed graphs
zbMATH Keywords: community detection
zbMATH Keywords: network analytics
zbMATH Keywords: maximal cliques
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.dam.2020.05.027
OpenAlex ID: W3035374762
cites work: The Enumeration of Maximal Cliques of Large Graphs
cites work: Reverse search for enumeration
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Q2753729
cites work: Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
cites work: An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
cites work: Directing Road Networks by Listing Strong Orientations
cites work: Listing Maximal Independent Sets with Minimal Space and Bounded Delay
cites work: Q4598291
cites work: Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
cites work: Q5136240
cites work: New polynomial delay bounds for maximal subgraph enumeration by proximity search
cites work: Q5315023
cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs
cites work: Bounded Arboricity to Determine the Local Structure of Sparse Graphs
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: Algorithm Theory - SWAT 2004
cites work: Q5226843
cites work: On cliques in graphs
cites work: Clique Relaxation Models in Social Network Analysis
cites work: A New Algorithm for Generating All the Maximal Independent Sets
DOI: 10.1016/J.DAM.2020.05.027
description: scientific article; zbMATH DE number 7395743