Enumeration aspects of maximal cliques and bicliques
From MaRDI portal
Publication:1028116
DOI10.1016/j.dam.2008.10.010zbMath1177.05056OpenAlexW2063498317MaRDI QIDQ1028116
Alain Gély, Bachir Sadi, Lhouari Nourine
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.010
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (16)
Proximity Search for Maximal Subgraph Enumeration ⋮ Scale reduction techniques for computing maximum induced bicliques ⋮ Tight lower bounds on the number of bicliques in false-twin-free graphs ⋮ Enumerating maximal bicliques in bipartite graphs with favorable degree sequences ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs ⋮ On the termination of some biclique operators on multipartite graphs ⋮ Efficient enumeration of maximal induced bicliques ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ Finding maximum edge bicliques in convex bipartite graphs ⋮ On the computation of fixed points in Boolean networks ⋮ Representation of lattices via set-colored posets ⋮ Enumerating all maximal biclusters in numerical datasets ⋮ Enumeration of Minimal Dominating Sets and Variants ⋮ Finding and enumerating large intersections ⋮ Handling least privilege problem and role mining in RBAC
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating bicliques of a graph in lexicographic order
- Consensus algorithms for the generation of all maximal bicliques
- On generating all maximal independent sets
- Finding all closed sets: A general approach
- An incremental concept formation approach for learning from databases
- Computing on-line the lattice of maximal antichains of posets
- A fast algorithm for building lattices
- Reverse search for enumeration
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Two Basic Algorithms in Concept Analysis
- The Complexity of Enumeration and Reliability Problems
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
- A New Algorithm for Generating All the Maximal Independent Sets
- A Survey of Combinatorial Gray Codes
- Comparing performance of algorithms for generating concept lattices
- A fast incremental algorithm for building lattices
- On Independent Sets and Bicliques in Graphs
- Algorithm Theory - SWAT 2004
- Formal Concept Analysis
- Graph-Theoretic Concepts in Computer Science
- On cliques in graphs
- On computing the size of a lattice and related decision problems
This page was built for publication: Enumeration aspects of maximal cliques and bicliques
