Theoretical underpinnings for maximal clique enumeration on perturbed graphs
type: Item
instance of: scholarly article
title: Theoretical underpinnings for maximal clique enumeration on perturbed graphs
zbMATH Open document ID: 1209.05243
author: William Hendrix
author: Matthew C. Schmidt
author: Paul Breimyer
author: Nagiza F. Samatova
published in: Theoretical Computer Science
publication date: 2010-06-07T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5717735
zbMATH Keywords: graph perturbation theory
zbMATH Keywords: maximal clique enumeration
zbMATH Keywords: graph algorithms
zbMATH Keywords: uncertain and noisy data
Wikidata QID: Q57439775
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.03.011
OpenAlex ID: W2086428708
cites work: The Enumeration of Maximal Cliques of Large Graphs
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Arboricity and Subgraph Listing Algorithms
cites work: Q4234100
cites work: On generating all maximal independent sets
cites work: Cliques of a graph-variations on the Bron-Kerbosch algorithm
cites work: Distributed approximate matching
cites work: A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
cites work: Algorithm Theory - SWAT 2004
cites work: On cliques in graphs
cites work: Q4230326
cites work: Finding all maximal cliques in dynamic graphs
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.1016/J.TCS.2010.03.011
DBLP publication ID: journals/tcs/HendrixSBS10
description: scientific article; zbMATH DE number 5717735