Enumeration aspects of maximal cliques and bicliques
type: Item
instance of: scholarly article
title: Enumeration aspects of maximal cliques and bicliques
zbMATH Open document ID: 1177.05056
author: Alain Gély
author: Lhouari Nourine
author: Bachir Sadi
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5571988
zbMATH Keywords: maximal cliques
zbMATH Keywords: maximal bicliques
zbMATH Keywords: lattice
zbMATH Keywords: enumeration algorithms
describes a project that uses: LCM
MaRDI profile type: Publication
full work available at URL: j.dam.2008.10.010
OpenAlex ID: W2063498317
cites work: Consensus algorithms for the generation of all maximal bicliques
cites work: Reverse search for enumeration
cites work: Q5685119
cites work: Q3029054
cites work: Q3139713
cites work: Q5609474
cites work: Generating bicliques of a graph in lexicographic order
cites work: Two Basic Algorithms in Concept Analysis
cites work: Finding all closed sets: A general approach
cites work: On Independent Sets and Bicliques in Graphs
cites work: Formal Concept Analysis
cites work: An incremental concept formation approach for learning from databases
cites work: On generating all maximal independent sets
cites work: Computing on-line the lattice of maximal antichains of posets
cites work: Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
cites work: On computing the size of a lattice and related decision problems
cites work: Comparing performance of algorithms for generating concept lattices
cites work: Algorithm Theory - SWAT 2004
cites work: Q5501778
cites work: On cliques in graphs
cites work: A fast algorithm for building lattices
cites work: A fast incremental algorithm for building lattices
cites work: Graph-Theoretic Concepts in Computer Science
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: A Survey of Combinatorial Gray Codes
cites work: A New Algorithm for Generating All the Maximal Independent Sets
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Q3952147
DOI: 10.1016/J.DAM.2008.10.010
Recommended article: Efficient enumeration of maximal induced bicliques
Recommended article: Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Recommended article: Q3976645
Recommended article: Q4688314
Recommended article: Algorithm Theory - SWAT 2004
Recommended article: On the maximum number of cliques in a graph
Recommended article: Bicliques in graphs. I: Bounds on their number
Recommended article: Theoretical underpinnings for maximal clique enumeration on perturbed graphs
Recommended article: Maximal Binary Cliques
description: scientific article; zbMATH DE number 5571988