A new decomposition technique for maximal clique enumeration for sparse graphs
type: Item
instance of: scholarly article
title: A new decomposition technique for maximal clique enumeration for sparse graphs
zbMATH Open document ID: 1421.68138
author: George Manoussakis
published in: Theoretical Computer Science
publication date: 2019-05-02T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7050143
zbMATH Keywords: enumeration
zbMATH Keywords: counting
zbMATH Keywords: algorithms
zbMATH Keywords: maximal cliques
zbMATH Keywords: \(k\)-degenerate graphs
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.10.014
OpenAlex ID: W2897305385
cites work: Emergence of Scaling in Random Networks
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
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: An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
cites work: Q4598291
cites work: Introduction to algorithms
cites work: Q4393480
cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs
cites work: On Independent Sets and Bicliques in Graphs
cites work: Bounded Arboricity to Determine the Local Structure of Sparse Graphs
cites work: Algorithms on Strings, Trees and Sequences
cites work: On generating all maximal independent sets
cites work: Extremal Combinatorics
cites work: Reducibility among Combinatorial Problems
cites work: k-Degenerate Graphs
cites work: Algorithm Theory - SWAT 2004
cites work: Q5111887
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: On cliques in 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
cites work: On-line construction of suffix trees
cites work: Exact Algorithms for Maximum Independent Set
cites work: Elimination graphs
DOI: 10.1016/J.TCS.2018.10.014
description: scientific article; zbMATH DE number 7050143