Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
type: Item
instance of: scholarly article
title: Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
zbMATH Open document ID: 1433.68287
author: Alessio Conte
author: Roberto Grossi
author: Andrea Marino
author: Luca Versari
published in: Algorithmica
publication date: 2020-04-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7189175
zbMATH Keywords: enumeration algorithms
zbMATH Keywords: maximal cliques
zbMATH Keywords: network mining and analytics
zbMATH Keywords: reverse search
zbMATH Keywords: space efficiency
zbMATH Keywords: polynomial-time delay
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: s00453-019-00656-8
OpenAlex ID: W2995561890
cites work: The Enumeration of Maximal Cliques of Large Graphs
cites work: Color-coding
cites work: Reverse search for enumeration
cites work: Listing Triangles
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: A note on the problem of reporting maximal cliques
cites work: Fast maximal cliques enumeration in sparse graphs
cites work: Arboricity and Subgraph Listing Algorithms
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: Q4598291
cites work: Listing Maximal Independent Sets with Minimal Space and Bounded Delay
cites work: Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
cites work: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs
cites work: Enumeration Of Labelled Graphs
cites work: Enumeration aspects of maximal cliques and bicliques
cites work: On generating all maximal independent sets
cites work: Algorithm Theory - SWAT 2004
cites work: On cliques in graphs
cites work: Corrections to Bierstone's Algorithm for Generating Cliques
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
cites work: A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: An efficient algorithm for solving pseudo clique enumeration problem
cites work: The complexity of computing the permanent
cites work: Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
Wikidata QID: Q126548757
DOI: 10.1007/S00453-019-00656-8
description: scientific article; zbMATH DE number 7189175