A note on the problem of reporting maximal cliques
type: Item
instance of: scholarly article
title: A note on the problem of reporting maximal cliques
zbMATH Open document ID: 1153.68038
author: C. Karande
author: Frédéric Cazals
published in: Theoretical Computer Science
publication date: 2008-11-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5368358
zbMATH Keywords: maximal cliques
zbMATH Keywords: output sensitive algorithms
zbMATH Keywords: maximal common subgraphs
zbMATH Keywords: enumeration problems
Wikidata QID: Q56210397
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.05.010
OpenAlex ID: W1974959172
cites work: The Enumeration of Maximal Cliques of Large Graphs
cites work: Q3145799
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: An algorithm for reporting maximal \(c\)-cliques
cites work: Enumerating all connected maximal common subgraphs in two graphs
cites work: On cliques in graphs
cites work: Algorithm Theory - SWAT 2004
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
DOI: 10.1016/J.TCS.2008.05.010
description: scientific article; zbMATH DE number 5368358