Covering graphs with few complete bipartite subgraphs
type: Item
instance of: scholarly article
title: Covering graphs with few complete bipartite subgraphs
zbMATH Open document ID: 1168.68019
author: Herbert Fleischner
author: Egbert Mujuni
author: Daniël Paulusma
author: Stefan Szeider
published in: Theoretical Computer Science
publication date: 2009-05-28T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5558987
zbMATH Keywords: bicliques
zbMATH Keywords: parameterized complexity
zbMATH Keywords: covering and partitioning problems
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.059
OpenAlex ID: W2166502815
cites work: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
cites work: Q3158579
cites work: Chromatic characterization of biclique covers
cites work: FindingH-partitions efficiently
cites work: Q4947393
cites work: Q4393480
cites work: Bipartite dimensions and bipartite degrees of graphs
cites work: On miniaturized problems in parameterized complexity theory
cites work: Q4198056
cites work: Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
cites work: Complexity of list coloring problems with a fixed total number of colors
cites work: Minimal NFA Problems are Hard
cites work: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
cites work: On edge perfectness and classes of bipartite graphs
cites work: A mathematical analysis of human leukocyte antigen serology
cites work: Q5710169
cites work: Q4152571
cites work: Computational Complexity of Compaction to Reflexive Cycles
cites work: Q3952147
DOI: 10.1016/J.TCS.2008.12.059
description: scientific article; zbMATH DE number 5558987