Efficient enumeration of maximal induced bicliques
DOI10.1016/J.DAM.2020.04.034zbMATH Open1472.05071OpenAlexW3034593152MaRDI QIDQ1983137FDOQ1983137
Authors: Danny Hermelin, George Manoussakis 
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Cites Work
- Algorithms on Strings, Trees and Sequences
- A New Algorithm for Generating All the Maximal Independent Sets
- k-Degenerate Graphs
- On cliques in graphs
- A Space-Economical Suffix Tree Construction Algorithm
- On generating all maximal independent sets
- On-line construction of suffix trees
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Algorithm Theory - SWAT 2004
- On Independent Sets and Bicliques in Graphs
- Bicliques in graphs. I: Bounds on their number
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Generating bicliques of a graph in lexicographic order
- On the generation of bicliques of a graph
- Consensus algorithms for the generation of all maximal bicliques
- Fast maximal cliques enumeration in sparse graphs
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- Enumeration aspects of maximal cliques and bicliques
- Arboricity and bipartite subgraph listing algorithms
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
Cited In (20)
- Title not available (Why is that?)
- Analysis and enumeration. Algorithms for biological graphs
- Linear-time algorithm for generating c-isolated bicliques
- On problem of finding all maximal induced bicliques of hypergraph
- Consensus algorithms for the generation of all maximal bicliques
- Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Computing dense and sparse subgraphs of weakly closed graphs
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
- Exact exponential-time algorithms for finding bicliques
- Algorithm Theory - SWAT 2004
- Efficient enumeration of bipartite subgraphs in graphs
- On Fast Enumeration of Pseudo Bicliques
- Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
- Algorithms for induced biclique optimization problems
- Enumeration aspects of maximal cliques and bicliques
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Formal Concept Analysis
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- On independent sets and bicliques in graphs
This page was built for publication: Efficient enumeration of maximal induced bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983137)
