Bicolored independent sets and bicliques

DOI10.1016/j.ipl.2012.01.010zbMath1243.68185OpenAlexW2090984414MaRDI QIDQ436317

Jean-François Couturier, Dieter Kratsch

Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.01.010

zbMATH Keywords

independent setgraph algorithmsexact exponential algorithmsbiclique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Computing dense and sparse subgraphs of weakly closed graphs ⋮ An exact exponential time algorithm for counting bipartite cliques ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating bicliques of a graph in lexicographic order
• Exact exponential algorithms.
• Consensus algorithms for the generation of all maximal bicliques
• On two techniques of combining branching and treewidth
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• The maximum edge biclique problem is NP-complete
• Exact exponential-time algorithms for finding bicliques
• On Bipartite and Multipartite Clique Problems
• A measure & conquer approach for the analysis of exact algorithms
• Counting Minimum Weighted Dominating Sets
• Inclusion/Exclusion Meets Measure and Conquer
• On Independent Sets and Bicliques in Graphs
• Algorithm Theory - SWAT 2004
• Node-and edge-deletion NP-complete problems
• On the generation of bicliques of a graph

This page was built for publication: Bicolored independent sets and bicliques