The K-clique Densest Subgraph Problem
The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Abstract
Numerous graph mining applications rely on detecting subgraphs which are large near-cliques. Since formulations that are geared towards finding large near-cliques are hard and frequently inapproximable due to connections with the Maximum Clique problem, the poly-time solvable densest subgraph problem which maximizes the average degree over all possible subgraphs "lies at the core of large scale data mining" [10]. However, frequently the densest subgraph problem fails in detecting large near-cliques in networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476 · cited 1×
“The MapReduce framework [20] has become the de facto standard for processing large-scale datasets.”
BackgroundAn automated method for finding molecular complexes in large protein interaction networks
Bader, G. D., & Hogue, C. W. (2003) · BMC Bioinformatics · doi:10.1186/1471-2105-4-2 · Cited by 6,072 · cited 1×
“In bioinformatics dense subgraphs are used for detecting protein complexes in protein-protein interaction networks [9] and for finding regulatory motifs in DNA [24].”
MethodAn experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431 · cited 1×
“In this work, we are primarily interested in the fact that maximizing a supermodular function is solvable in strongly polynomial time [30, 34, 42, 46].”
BackgroundClique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369 · cited 1×
“Unfortunately, these formulations are NP-hard and also inapproximable due the connections with the Maximum Clique problem [32].”
BackgroundSubmodular functions and convexity
Lovász, L. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_10 · Cited by 964 · cited 1×
“In this work, we are primarily interested in the fact that maximizing a supermodular function is solvable in strongly polynomial time [30, 34, 42, 46].”
BackgroundMultiplying matrices faster than coppersmith-winograd
Williams, V. V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214056 · Cited by 850 · cited 3×
“3729 due to [53].”
MethodInfluentialA combinatorial strongly polynomial algorithm for minimizing submodular functions
Iwata, S., Fleischer, L., & Fujishige, S. (2001) · Journal of the ACM · doi:10.1145/502090.502096 · Cited by 683
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
Schrijver, A. (2000) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.2000.1989 · Cited by 651 · cited 1×
“In this work, we are primarily interested in the fact that maximizing a supermodular function is solvable in strongly polynomial time [30, 34, 42, 46].”
BackgroundAn O(m) Algorithm for Cores Decomposition of Networks
Batagelj, V., & Zaveršnik, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0310049 · Cited by 627
Finding and counting given length cycles
Alon, N., Yuster, R., & Zwick, U. (1997) · Algorithmica · doi:10.1007/bf02523189 · Cited by 608 · cited 6×
“The algo-rithm of Alon, Yuster and Zwick [4] runs in O ( m 2 ω/ ( ω +1) ) time where ω 2 .”
BackgroundMethodInfluentialFinding a Maximum Density Subgraph
Goldberg, A. V. (1984) · UC Berkeley · Cited by 598
Feige, U., Peleg, D., & Kortsarz, G. (2001) · Algorithmica · doi:10.1007/s004530010050 · Cited by 592 · cited 1×
“Since dense subgraph discovery constitutes a main research topic in graph analysis, a wide variety of related methods exists: heuristics [49, 52, 54], algorithmic contributions on NP -hard formulations [5, 12, 22, 40, ?”
MethodThe community-search problem and how to plan a successful cocktail party
Sozio, M., & Gionis, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835923 · Cited by 490 · cited 1×
“We refer to this type of graph mining problems as cocktail problems , due to the following motivation, c.f. [47].”
BackgroundGreedy Approximation Algorithms for Finding Dense Components in a Graph
Charikar, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44436-x_10 · Cited by 479 · cited 10×
“Charikar [18] proved that the greedy algorithm proposed by Asashiro et al.”
BackgroundMethodResultInfluentialDiscovering large dense subgraphs in massive graphs
Gibson, D., Kumar, R., & Tomkins, A. (2005) · Very Large Data Bases · Cited by 471
A Model of Computation for MapReduce
Karloff, H. J., Suri, S., & Vassilvitskii, S. (2010) · Cited by 454
A Fast Parametric Maximum Flow Algorithm and Applications
Gallo, G., Grigoriadis, M. D., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218003 · Cited by 427 · cited 4×
“New formulation: We introduce the k-clique densest subgraph problem (k-Clique-DS-Problem) which generalizes the well-studied DS-Problem [18, 25, 28, 40].”
BackgroundMethodInfluentialDetecting high log-densities: an O ( n ¼ ) approximation for densest k -subgraph
Bhaskara, A., Charikar, M., Chlamtáč, E., Feige, U., & Vijayaraghavan, A. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806719 · Cited by 426 · cited 1×
“Since dense subgraph discovery constitutes a main research topic in graph analysis, a wide variety of related methods exists: heuristics [49, 52, 54], algorithmic contributions on NP-hard formulations [5, 12, 22, 40, 49] and poly-time solvable formulations [18, 40, 49].”
BackgroundCounting triangles and the curse of the last reducer
Suri, S., & Vassilvitskii, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963491 · Cited by 408 · cited 2×
“The algorithm requires O (log( n ) /ǫ ) rounds and is MapReduce efficient [39] due to the existence of efficient MapReduce triangle counting algorithms, e.g., [48].”
MethodFinding a Minimum Circuit in a Graph
Itai, A., & Rodeh, M. (1978) · SIAM Journal on Computing · doi:10.1137/0207033 · Cited by 391
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., & Tsiarli, M. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487645 · Cited by 294 · cited 3×
“This variation is useful in various data-mining and bioinformatics tasks, see [49].”
BackgroundSelf-citationA scalable pattern mining approach to web graph compression with communities
Buehrer, G., & Chellapilla, K. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341547 · Cited by 246 · cited 1×
“They are also used for detecting link spam in Web graphs [26], graph compression [17] and mining micro-blogging streams [6].”
MethodA faster strongly polynomial time algorithm for submodular function minimization
Orlin, J. B. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0189-2 · Cited by 243 · cited 1×
“In each round we maximize function f α using Orlin-Supermodular-Opt which takes as input arguments the graph G and the parameter α > 0 [43].”
MethodKhuller, S., & Saha, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02927-1_50 · Cited by 241 · cited 5×
“New formulation: We introduce the k-clique densest subgraph problem (k-Clique-DS-Problem) which generalizes the well-studied DS-Problem [18, 25, 28, 40].”
BackgroundMethodInfluentialDensest subgraph in streaming and MapReduce
Bahmani, B., Kumar, R., & Vassilvitskii, S. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2140436.2140442 · Cited by 219 · cited 3×
“Finally, the densest subgraph problem has been considered in various settings, including MapReduce [10], the streaming [10], the dynamic setting [21, 45] and their combination recently [13].”
BackgroundMethodGreedily Finding a Dense Subgraph
Asahiro, Y., Iwama, K., Tamaki, H., & Tokuyama, T. (2000) · Journal of Algorithms · doi:10.1006/jagm.1999.1062 · Cited by 211 · cited 3×
“Furthermore, we propose an efficient 1 k -approximation algorithm which generalizes the greedy peeling algorithm of Asahiro and Charikar [8, 18] for k = 2.”
BackgroundMethodEfficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
Kolountzakis, M. N., Miller, G. L., Peng, R., & Tsourakakis, C. E. (2012) · Internet Mathematics · doi:10.1080/15427951.2012.625260 · Cited by 172
Self-citationExtracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
Zhang, Y., & Parthasarathy, S. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.35 · Cited by 168 · cited 1×
“Since dense subgraph discovery constitutes a main research topic in graph analysis, a wide variety of related methods exists: heuristics [49, 52, 54], algorithmic contributions on NP -hard formulations [5, 12, 22, 40, ?”
MethodMotifCut: regulatory motifs finding with maximum density subgraphs
Fratkin, E., Naughton, B. T., Brutlag, D. L., & Batzoglou, S. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl243 · Cited by 165 · cited 1×
“In bioinformatics dense subgraphs are used for detecting protein complexes in protein-protein interaction networks [9] and for finding regulatory motifs in DNA [24].”
MethodDense subgraph maintenance under streaming edge weight updates for real-time story identification
Angel, A., Sarkas, N., Koudas, N., & Srivastava, D. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2168651.2168658 · Cited by 163
A space efficient streaming algorithm for triangle counting using the birthday paradox
Jha, M. K., Seshadhri, C., & Pinar, A. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487678 · Cited by 154 · cited 1×
“Finally a wealth of approximate triangle counting methods exist [35, 41, 44, 51].”
MethodComplexity of finding dense subgraphs
Asahiro, Y., Hassin, R., & Iwama, K. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00243-8 · Cited by 151 · cited 1×
“study the complexity of finding dense subgraphs by introducing a generalization of the DSProblem and the maximum clique problem [7].”
BackgroundEfficient Densest Subgraph Computation in Evolving Graphs
Epasto, A., Lattanzi, S., & Sozio, M. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741638 · Cited by 122 · cited 1×
“Finally, the densest subgraph problem has been considered in various settings, including MapReduce [10], the streaming [10], the dynamic setting [21, 45] and their combination recently [13].”
BackgroundDense subgraph maintenance under streaming edge weight updates for real-time story identification
Angel, A., Koudas, N., Sarkas, N., Srivastava, D., Svendsen, M. S., & Tirthapura, S. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0340-z · Cited by 119 · cited 1×
“They are also used for detecting link spam in Web graphs [26], graph compression [17] and mining micro-blogging streams [6].”
MethodPiggybacking on social networks
Gionis, A., Junqueira, F., Leroy, V., Serafini, M., & Weber, I. G. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536336.2536342 · Cited by 42 · cited 1×
“The DS-Problem is a powerful primitive for many graph applications including social pig-gybacking [27], reachability and distance query indexing [19, 37].”
Background
Cited by
FRAUDAR: Bounding Graph Fraud in the Face of Camouflage
Hooi, B., Song, H. A., Beutel, A., Shah, N., Shin, K., & Faloutsos, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939747 · Cited by 305
“Variants have been proposed to efficiently find large, dense subgraphs [27], with approximation guarantees.”
BackgroundSearch Rank Fraud De-Anonymization in Online Systems
Rahman, M., Hernandez, N., Carbunar, B., & Chau, D. H. (2018) · Proceedings of the 29th on Hypertext and Social Media · doi:10.1145/3209542.3209555 · Cited by 8
Metadata
- Authors
- Tsourakakis, C.
- Venue
- Proceedings of the 24th International Conference on World Wide Web
- Published
- 2015-05-18
- Pages
- 1122-1132
- OpenAlex
- W2266714125
- Cited by
- 245
- References
- 36
- FWCI
- 7.48
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.