Fast Algorithms for the Maximum Clique Problem on Massive Sparse GraphsReport as inadecuate



 Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs


Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, informatics, and many other areas. Although there exist several algorithms with acceptable runtimes for certain classes of graphs, many of them are infeasible for massive graphs. We present a new exact algorithm that employs novel pruning techniques to very quickly find maximum cliques in large sparse graphs. Extensive experiments on several types of synthetic and real-world graphs show that our new algorithm is up to several orders of magnitude faster than existing algorithms for most instances. We also present a heuristic variant that runs orders of magnitude faster than the exact algorithm, while providing optimal or near-optimal solutions.



Author: Bharath Pattabiraman; Md. Mostofa Ali Patwary; Assefaw H. Gebremedhin; Wei-keng Liao; Alok Choudhary

Source: https://archive.org/







Related documents