Efficient enumeration of maximal induced bicliques
From MaRDI portal
(Redirected from Efficient enumeration of maximal induced bicliques)
Recommendations
Cites work
- k-Degenerate Graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithm Theory - SWAT 2004
- Algorithms on Strings, Trees and Sequences
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- Arboricity and bipartite subgraph listing algorithms
- Bicliques in graphs. I: Bounds on their number
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Consensus algorithms for the generation of all maximal bicliques
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- Enumeration aspects of maximal cliques and bicliques
- Fast maximal cliques enumeration in sparse graphs
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Generating bicliques of a graph in lexicographic order
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
- On cliques in graphs
- On generating all maximal independent sets
- On Independent Sets and Bicliques in Graphs
- On the generation of bicliques of a graph
- On-line construction of suffix trees
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- The worst-case time complexity for generating all maximal cliques and computational experiments
Cited in
(21)- Enumeration aspects of maximal cliques and bicliques
- Efficient enumeration of bipartite subgraphs in graphs
- Exact exponential-time algorithms for finding bicliques
- Algorithms for induced biclique optimization problems
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
- Analysis and enumeration. Algorithms for biological graphs
- On independent sets and bicliques in graphs
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Scale reduction techniques for computing maximum induced bicliques
- On Fast Enumeration of Pseudo Bicliques
- Linear-time algorithm for generating c-isolated bicliques
- On problem of finding all maximal induced bicliques of hypergraph
- Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
- Algorithm Theory - SWAT 2004
- Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
- Formal Concept Analysis
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- Computing dense and sparse subgraphs of weakly closed graphs
- Consensus algorithms for the generation of all maximal bicliques
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)
