Local search for diversified top-k clique search problem

DOI10.1016/J.COR.2019.104867MaRDI QIDQ2289947zbMATH OpenOpenAlexWikidataFDO

Authors Jun Wu, Lu Jiang, Junping Zhou, Minghao Yin, Chu-Min Li

Publication date 27 January 2020

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.104867

zbMATH Keywords

clique scoring strategyconfiguration checkinglocal searchtop-\(k\) clique search

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An effective local search for the maximum clique problem
• scientific article
• A local core number based algorithm for the maximum clique problem
• Algorithms for the maximum k-club problem in graphs
• An adaptive multistart tabu search approach to solve the maximum clique problem

Cites work

• A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
• Algorithm 457: finding all cliques of an undirected graph
• An efficient local search framework for the minimum weighted vertex cover problem
• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
• Fast maximal cliques enumeration in sparse graphs
• Improving configuration checking for satisfiable random \(k\)-SAT instances
• Local search for Boolean satisfiability with configuration checking and subscore
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• The Enumeration of Maximal Cliques of Large Graphs

Cited in

(3)

• Local Search for Max-Sum Diversification
• On solving simplified diversified top-k\,s-plex problem
• A bisection method for solving distance-based clustering problems globally

Describes a project that uses

Uses Software

• CCASat
• CCLS
• Algorithm 457

This page was built for publication: Local search for diversified top-\(k\) clique search problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289947)