Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

DOI10.1007/978-3-319-03536-9_13zbMath1342.05185arXiv1209.5818OpenAlexW1849256610MaRDI QIDQ2938025

Bharath Pattabiraman, Md. Mostofa Ali Patwary, Wei-Keng Liao, Alok N. Choudhary, Assefaw Hadish Gebremedhin

Publication date: 13 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.5818

zbMATH Keywords

sparse graphsmaximum cliques

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Internet topics (68M11) Density (toughness, etc.) (05C42)

Related Items

Parallel Maximum Clique Algorithms with Applications to Network Analysis, A new exact maximum clique algorithm for large and massive sparse graphs, Solving larger maximum clique problems using parallel quantum annealing, Why Is Maximum Clique Often Easy in Practice?, Multi-threading a state-of-the-art maximum clique algorithm, A parallel maximum clique algorithm for large and massive sparse graphs

Uses Software

• SparseMatrix