Fetching the paper…
Reading the bibliography…
Combinatorial optimization problems arise in a wide range of applications from diverse domains.
On random graphs, I
P. Erdös and A. Rényi · 1959
Earlier work this paper cites.
An upper bound for the chromatic number of a graph and its application to timetabling problems
D. J. Welsh and M. B. Powell · 1967
Earlier work this paper cites.
Algorithm 457: finding all cliques of an undirected graph
C. Bron and J. Kerbosch · 1973
Earlier work this paper cites.
The probabilistic analysis of some combinatorial search algorithms
R. M. Karp · 1976
Earlier work this paper cites.
Informant accuracy in social network data iv: a comparison of clique-level structure in behavioral and cognitive network data
H. R. Bernard, P. D. Killworth, and L. Sailer · 1979
Earlier work this paper cites.
Goodness-of-fit statistics for discrete multivariate data
T. R. C. Read and N. A. C. Cressie · 1988
Earlier work this paper cites.
Pearson’s χ 2 \chi^{2} and the likelihood ratio statistic G 2 G^{2} : a comparative review
T. Read and N. Cressie · 1989
Earlier work this paper cites.
Large cliques elude the Metropolis process
M. Jerrum · 1992
Earlier work this paper cites.
Social network analysis: Methods and applications
K. Faust and S. Wasserman · 1995
Earlier work this paper cites.
Combinatorial algorithms for dna sequence assembly
J. C. Kececioglu and E. W. Myers · 1995
Earlier work this paper cites.
Expected complexity of graph partitioning problems
L. Kučera · 1995
Earlier work this paper cites.
The Maximum Clique Problem
I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo · 1999
Earlier work this paper cites.
A fast algorithm for the maximum clique problem
P. R. Östergård · 2002
Earlier work this paper cites.
Friends and neighbors on the Web
L. A. Adamic and E. Adar · 2003
Earlier work this paper cites.
High performance computational tools for Motif discovery
N. E. Baldwin, R. L. Collins, M. A. Langston, M. R. Leuze, C. T. Symons, and B. H. Voy · 2004
Earlier work this paper cites.
Finding all maximal cliques in dynamic graphs
V. Stix · 2004
Earlier work this paper cites.
Network motifs in integrated cellular networks of transcription–regulation and protein–protein interaction
E. Yeger-Lotem, S. Sattath, N. Kashtan, S. Itzkovitz, R. Milo, R. Y. Pinter, U. Alon, and H. Margalit · 2004
Earlier work this paper cites.
On the relative efficiency of maximal clique enumeration algorithms, with applications to high-throughput computational biology
F. N. Abu-Khzam, N. E. Baldwin, M. A. Langston, and N. F. Samatova · 2005
Earlier work this paper cites.
Statistical analysis of financial networks
V. Boginski, S. Butenko, and P. M. Pardalos · 2005
Earlier work this paper cites.
Uncovering the overlapping community structure of complex networks in nature and society
G. Palla, I. Derényi, I. Farkas, and T. Vicsek · 2005
Earlier work this paper cites.
Clique-detection models in computational biochemistry and genomics
S. Butenko and W. Wilhelm · 2006
Earlier work this paper cites.
Strong computational lower bounds via parameterized complexity
J. Chen, X. Huang, I. A. Kanj, and G. Xia · 2006
Cited alongside, same era.
The igraph software package for complex network research
G. Csardi and T. Nepusz · 2006
Cited alongside, same era.
Linear degree extractors and the inapproximability of max clique and chromatic number
D. Zuckerman · 2006
Cited alongside, same era.
The maximum clique problem: Algorithms, applications, and implementations
J. D. Eblen · 2010
Cited alongside, same era.
Community detection in graphs
S. Fortunato · 2010
Cited alongside, same era.
Combinatorial optimization: exact and approximate algorithms
L. Trevisan · 2011
Cited alongside, same era.
A guide to graph colouring
R. Lewis · 2015
Later among the works it cites.
Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection
B. Pattabiraman, M. Patwary, A. Gebremedhin, W. Liao, and A. Choudhary · 2015
Later among the works it cites.
The network data repository with interactive graph analytics and visualization
R. A. Rossi and N. K. Ahmed · 2015
Later among the works it cites.
Parallel maximum clique algorithms with applications to network analysis
R. A. Rossi, D. F. Gleich, and A. H. Gebremedhin · 2015
Later among the works it cites.
Pointer networks
O. Vinyals, M. Fortunato, and N. Jaitly · 2015
Later among the works it cites.
Neural combinatorial optimization with reinforcement learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The maximum clique enumeration problem: algorithms, applications, and implementations
J. D. Eblen, C. A. Phillips, G. L. Rogers, and M. A. Langston · 2012
Cited alongside, same era.
Combinatorial optimization
B. Korte, J. Vygen, B. Korte, and J. Vygen · 2012
Cited alongside, same era.
Community detection in social media
S. Papadopoulos, Y. Kompatsiaris, A. Vakali, and P. Spyridonos · 2012
Cited alongside, same era.
Planning as satisfiability: Heuristics
J. Rintanen · 2012
Cited alongside, same era.
Spectral sparsification of graphs: Theory and algorithms
J. Batson, D. A. Spielman, N. Srivastava, and S.-H. Teng · 2013
Cited alongside, same era.
Modern graph theory
B. Bollobás · 2013
Cited alongside, same era.
I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio · 2016
Later among the works it cites.
Scheduling under a non-reversible energy source: An application of piecewise linear bounding of non-linear demand/cost functions
S. Ngueveu, C. Artigues, and P. Lopez · 2016
Later among the works it cites.
A new exact maximum clique algorithm for large and massive sparse graphs
P. San Segundo, A. Lopez, and P. M. Pardalos · 2016
Later among the works it cites.
Run time application repartitioning in dynamic mobile cloud environments
L. Yang, J. Cao, S. Tang, D. Han, and N. Suri · 2016
Later among the works it cites.
Neighbor-Aware Search for Approximate Labeled Graph Matching using the Chi-Square Statistics
S. Dutta, P. Nayek, and A. Bhattacharya · 2017
Later among the works it cites.
Statistical algorithms and a lower bound for detecting planted cliques
V. Feldman, E. Grigorescu, L. Reyzin, S. S. Vempala, and Y. Xiao · 2017
Later among the works it cites.
Learning combinatorial optimization algorithms over graphs
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song · 2017
Later among the works it cites.
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
C. Li, H. Jiang, and F. Manyàc · 2017
Later among the works it cites.
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
C.-M. Li, H. Jiang, and F. Manyà · 2017
Later among the works it cites.
Finding the maximum clique in massive graphs
C. Lu, J. Yu, H. Wei, and Y. Zhang · 2017
Later among the works it cites.
Scalability of using restricted boltzmann machines for combinatorial optimization
M. Probst, F. Rothlauf, and J. Grahl · 2017
Later among the works it cites.
A survey of machine learning for combinatorial optimization
G. A. D. Caro · 2019
Later among the works it cites.
Finding a maximum clique in dense graphs via χ 2 \chi^{2} statistics
S. Dutta and J. Lauri · 2019
Later among the works it cites.
Learning multi-stage sparsification for maximum clique enumeration
M. Grassia, J. Lauri, S. Dutta, and D. Ajwani · 2019
Later among the works it cites.
Fine-grained search space classification for hard enumeration variants of subset problems
J. Lauri and S. Dutta · 2019
Later among the works it cites.
Learning heuristics over large graphs via deep reinforcement learning
A. Mittal, A. Dhawan, S. Medya, S. Ranu, and A. K. Singh · 2019
Later among the works it cites.