Recommendations
Cites work
- scientific article; zbMATH DE number 2086260 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2119675 (Why is no real title available?)
- scientific article; zbMATH DE number 877297 (Why is no real title available?)
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- A branch-and-reduce algorithm for finding a minimum independent dominating set
- A fast algorithm for building lattices
- A fast incremental algorithm for building lattices
- A fine-grained analysis of a simple independent set algorithm
- A measure \& conquer approach for the analysis of exact algorithms
- Algorithm Theory - SWAT 2004
- Algorithms for Counting 2-Sat Solutions and Colorings with Applications
- Algorithms for maximum independent sets
- An exact algorithm for the maximum leaf spanning tree problem
- Approximating Clique and Biclique Problems
- 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
- Counting models for 2SAT and 3SAT formulae
- Counting the number of independent sets in chordal graphs
- Design by measure and conquer. A faster exact algorithm for dominating set
- Generating bicliques of a graph in lexicographic order
- Inclusion/Exclusion Meets Measure and Conquer
- Node-and edge-deletion NP-complete problems
- On Independent Sets and Bicliques in Graphs
- On bipartite and multipartite clique problems
- On cliques in graphs
- On the generation of bicliques of a graph
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Set partitioning via inclusion-exclusion
- The maximum edge biclique problem is NP-complete
Cited in
(30)- On bicliques and the second clique graph of suspensions
- On Independent Sets and Bicliques in Graphs
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Inclusion/exclusion meets measure and conquer
- On the Number of Connected Sets in Bounded Degree Graphs
- scientific article; zbMATH DE number 6806045 (Why is no real title available?)
- Linear-time algorithm for generating c-isolated bicliques
- Generating bicliques of a graph in lexicographic order
- Bicolored independent sets and bicliques
- An exact exponential time algorithm for counting bipartite cliques
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Counting the maximal independent sets in power set graphs
- On co-bicliques
- On the generation of bicliques of a graph
- Computing \(k\)-independent sets for regular bipartite graphs
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- Computing dense and sparse subgraphs of weakly closed graphs
- scientific article; zbMATH DE number 6260097 (Why is no real title available?)
- A note on bipartite subgraphs and triangle-independent sets
- Efficient enumeration of maximal induced bicliques
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- The bipartite QUBO
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Tight lower bounds on the number of bicliques in false-twin-free graphs
- Largest chordal and interval subgraphs faster than \(2^n\)
- Bicliques in graphs. I: Bounds on their number
- Colorings with few colors: counting, enumeration and combinatorial bounds
- On the number of connected sets in bounded degree graphs
This page was built for publication: On independent sets and bicliques in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428684)
