Fast maximal cliques enumeration in sparse graphs
type: Item
instance of: scholarly article
title: Fast maximal cliques enumeration in sparse graphs
zbMATH Open document ID: 1263.05045
author: Lijun Chang
author: Jeffrey Xu Yu
author: Lu Qin
published in: Algorithmica
publication date: 2013-05-16T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6163652
zbMATH Keywords: maximal clique
zbMATH Keywords: polynomial delay
zbMATH Keywords: sparse graph
zbMATH Keywords: \(H\)-partition
zbMATH Keywords: \(H\)-value
describes a project that uses: Cluster-C
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: s00453-012-9632-8
OpenAlex ID: W1983365058
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Arboricity and Subgraph Listing Algorithms
cites work: The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
cites work: On generating all maximal independent sets
cites work: Algorithm Theory - SWAT 2004
cites work: Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
cites work: A New Algorithm for Generating All the Maximal Independent Sets
DOI: 10.1007/S00453-012-9632-8
description: scientific article; zbMATH DE number 6163652