Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
From MaRDI portal
Publication:2942692
DOI10.1287/ijoc.2014.0618zbMath1327.90356OpenAlexW2131169256MaRDI QIDQ2942692
Anurag Verma, Austin Buchanan, Sergiy I. Butenko
Publication date: 11 September 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cebc4d29a5de8c72991b3d53a9e75f68f904ef87
vertex coloringexact algorithmmaximum cliqueclique relaxation\(k\)-core\(k\)-communityscale reductionvery-large-scale networks
Related Items (17)
Scale reduction techniques for computing maximum induced bicliques ⋮ Detecting robust cliques in graphs subject to uncertain edge failures ⋮ Frequency-driven tabu search for the maximum \(s\)-plex problem ⋮ Influence Maximization with Latency Requirements on Social Networks ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs ⋮ Bounds and algorithms for graph trusses ⋮ Constraint and Satisfiability Reasoning for Graph Coloring ⋮ Parsimonious formulations for low-diameter clusters ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ Graph signatures: identification and optimization ⋮ On robust clusters of minimum cardinality in networks ⋮ On the maximum small-world subgraph problem ⋮ New heuristic approaches for maximum balanced biclique problem ⋮ Worst-case analysis of clique MIPs
This page was built for publication: Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
