Compact Representations of Geometric Bipartite Graphs via Weighted Biclique Covers
Open Access
- 6 November 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1141-1152
Abstract
No abstract availableThis publication has 38 references indexed in Scilit:
- Speeding‐Up Graph Algorithms via Clique PartitioningNetworks, 2026
- On Forbidden Induced Subgraphs for Unit Disk GraphsDiscrete & Computational Geometry, 2018
- Edge clique covering sum of graphsActa Mathematica Hungarica, 2016
- Nearly Tight Approximability Results for Minimum Biclique Cover and Partition2014
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion2006
- Efficient Data Storage in Large NanoarraysTheory of Computing Systems, 2005
- Zero Knowledge and the Chromatic NumberJournal of Computer and System Sciences, 1998
- Clique Partitions, Graph Compression and Speeding-Up AlgorithmsJournal of Computer and System Sciences, 1995
- Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matricesCombinatorica, 1984
- On the decomposition of graphs into complete bipartite subgraphs1983