New bounds for the CLIQUE-GAP problem using graph decomposition theory
type: Item
instance of: scholarly article
title: New bounds for the CLIQUE-GAP problem using graph decomposition theory
zbMATH Open document ID: 1391.68048
author: Vladimir Braverman
author: Zaoxing Liu
author: Tejasvam Singh
author: N. V. Vinodchandran
author: Lin F. Yang
published in: Algorithmica
publication date: 2018-04-06T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6856554
zbMATH Keywords: communication complexity
zbMATH Keywords: clique
zbMATH Keywords: streaming algorithm
zbMATH Keywords: graph decomposition
zbMATH Keywords: triangle counting
MaRDI profile type: Publication
full work available at URL: s00453-017-0277-5
OpenAlex ID: W2577465605
cites work: Graph Sparsification in the Semi-streaming Model
cites work: Q4250228
cites work: Q4228450
cites work: Q4828992
cites work: Estimating Clustering Indexes in Data Streams
cites work: On the Decomposition of Graphs
cites work: Q3312268
cites work: A second look at counting triangles in graph streams
cites work: Trading off space for passes in graph streaming problems
cites work: Compressed sensing
cites work: Q5743414
cites work: Streaming and Communication Complexity of Clique Approximation
cites work: Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24--28, 2015. Proceedings. Part II
cites work: Computing and Combinatorics
cites work: Streaming Lower Bounds for Approximating MAX-CUT
cites work: Approximate Counting of Cycles in Streams
DOI: 10.1007/S00453-017-0277-5
description: scientific article; zbMATH DE number 6856554