A clique-partitioning preprocessing algorithm that replaces bipartite cliques with tripartite graphs to reduce edge count and accelerate downstream graph algorithms, with claimed O(m n^δ) time and up to 74% edge reduction on large instances.
Graphzip: a clique-based sparse graph compression method
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Speeding-up Graph Algorithms via Clique Partitioning
A clique-partitioning preprocessing algorithm that replaces bipartite cliques with tripartite graphs to reduce edge count and accelerate downstream graph algorithms, with claimed O(m n^δ) time and up to 74% edge reduction on large instances.