On Independent Sets and Bicliques in Graphs
From MaRDI portal
Publication:5302053
Recommendations
- On independent sets and bicliques in graphs
- Independent sets, cliques, and colorings in graphons
- scientific article; zbMATH DE number 5593359
- On independent sets in hypergraphs
- scientific article; zbMATH DE number 6260097
- Independent sets, cliques and hamiltonian graphs
- scientific article; zbMATH DE number 31760
- Independent sets and partitions of graphs
- Bicolored independent sets and bicliques
- Independent set dominating sets in bipartite graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 877297 (Why is no real title available?)
- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- A fast algorithm for building lattices
- A fast incremental algorithm for building lattices
- Algorithm Theory - SWAT 2004
- Algorithms for maximum independent sets
- Approximating Clique and Biclique Problems
- Automata, Languages and Programming
- 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
- Design by measure and conquer. A faster exact algorithm for dominating set
- Generating bicliques of a graph in lexicographic order
- Graph-Theoretic Concepts in Computer Science
- Measure and conquer
- Node-and edge-deletion NP-complete problems
- On bipartite and multipartite clique problems
- On cliques in graphs
- On generating all maximal independent sets
- On the generation of bicliques of a graph
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- The maximum edge biclique problem is NP-complete
Cited in
(25)- On independent sets and bicliques in graphs
- Computing \(k\)-independent sets for regular bipartite graphs
- scientific article; zbMATH DE number 6260097 (Why is no real title available?)
- A note on bipartite subgraphs and triangle-independent sets
- On vertex independence number of uniform hypergraphs
- Bicliques in graphs. I: Bounds on their number
- scientific article; zbMATH DE number 6806045 (Why is no real title available?)
- Bicolored independent sets and bicliques
- On problem of finding all maximal induced bicliques of hypergraph
- Generating bicliques of a graph in lexicographic order
- 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
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Feedback vertex sets in tournaments
- Exact exponential-time algorithms for finding bicliques
- Covering and packing in linear space
- Problems and invariants connected with bicliques and multicliques of graphs
- Efficient enumeration of maximal induced bicliques
- On bicliques and the second clique graph of suspensions
- Counting Maximal Independent Sets in Subcubic Graphs
- Enumeration aspects of maximal cliques and bicliques
- A new decomposition technique for maximal clique enumeration for sparse graphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
- On co-bicliques
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 Q5302053)
