Linear-time algorithm for generating c-isolated bicliques
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)
Recommendations
Cites work
- An efficient exact algorithm for constraint bipartite vertex cover
- Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
- Constraint bipartite vertex cover: simpler exact algorithms and implementations
- Enumeration of isolated cliques and pseudo-cliques
- Generating bracelets with fixed content
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- Isolation concepts for clique enumeration: comparison and computational experiments
- Isolation concepts for efficiently enumerating dense subgraphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On independent sets and bicliques in graphs
- On the generation of bicliques of a graph
- The Parameterized Complexity of Enumerating Frequent Itemsets
- Trees having many minimal dominating sets
Cited in
(3)
This page was built for publication: Linear-time algorithm for generating c-isolated bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976342)