Efficient enumeration of maximal induced bicliques
From MaRDI portal
Publication:1983137
DOI10.1016/j.dam.2020.04.034zbMath1472.05071OpenAlexW3034593152MaRDI QIDQ1983137
George Manoussakis, Danny Hermelin
Publication date: 15 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.034
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
On Problem of Finding all Maximal Induced Bicliques of Hypergraph ⋮ Computing dense and sparse subgraphs of weakly closed graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Generating bicliques of a graph in lexicographic order
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Consensus algorithms for the generation of all maximal bicliques
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Enumeration aspects of maximal cliques and bicliques
- On generating all maximal independent sets
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Arboricity and bipartite subgraph listing algorithms
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- On-line construction of suffix trees
- Fast maximal cliques enumeration in sparse graphs
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- A Space-Economical Suffix Tree Construction Algorithm
- A New Algorithm for Generating All the Maximal Independent Sets
- Algorithms on Strings, Trees and Sequences
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
- On Independent Sets and Bicliques in Graphs
- Algorithm Theory - SWAT 2004
- k-Degenerate Graphs
- On the generation of bicliques of a graph
- On cliques in graphs
- Bicliques in graphs. I: Bounds on their number
This page was built for publication: Efficient enumeration of maximal induced bicliques
