A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems

No abstract is available for this paper.

• Publication year

  2019

• Venue

  Annals of Operations Research

• Publication date

  2019-02-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10479-019-03159-5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Maximum weight relaxed cliques and Russian Doll Search revisited

  2018cited by this paper
• A combined approach for analysing heuristic algorithms

  2018cited by this paper
• A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs

  2018cited by this paper
• Approaches for finding cohesive subgroups in large‐scale social networks via maximum k‐plex detection

  2017cited by this paper
• A hybrid iterated local search heuristic for the maximum weight independent set problem

  2017cited by this paper
• A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis

  2017cited by this paper
• Frequency-driven tabu search for the maximum s-plex problem

  2017cited by this paper
• Multivariate Algorithmics for Finding Cohesive Subnetworks

  2016cited by this paper
• Two Efficient Local Search Algorithms for Maximum Weight Clique Problem

  2016cited by this paper
• A Hybrid Metaheuristic for the Maximum k-Plex Problem

  2014influential reference
• A network-based data mining approach to portfolio selection via weighted clique relaxations

  2013cited by this paper
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

  2013cited by this paper
• On clique relaxation models in network analysis

  2013cited by this paper
• Multi-neighborhood tabu search for the maximum weight clique problem

  2012cited by this paper
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

  2011cited by this paper
• Dynamic Local Search for the Maximum Clique Problem

  2011cited by this paper
• Combinatorial algorithms for the maximum k-plex problem

  2010cited by this paper
• Advanced Multi-start Methods

  2010cited by this paper
• Inter-block GPU communication via fast barrier synchronization

  2010cited by this paper
• Handbook of Metaheuristics

  2010cited by this paper
• Graph theoretic generalizations of clique: optimization and extensions

  2009cited by this paper
• Independence Systems and Stable Set Relaxations

  2008cited by this paper
• A fast algorithm for the maximum clique problem

  2002cited by this paper
• An exact algorithm for the maximum clique problem

  1990cited by this paper
• The combined approach.

  1981cited by this paper
• A graph‐theoretic generalization of the clique concept*

  1978cited by this paper

• A local search algorithm with movement gap and adaptive configuration checking for the maximum weighted s-plex problem

  2024cites this paper
• GPU tabu search: A study on using GPU to solve massive instances of the maximum diversity problem

  2024cites this paper
• Fast Maximum $k$-Plex Algorithms Parameterized by Small Degeneracy Gaps

  2023cites this paper
• A versatile, fast and unbiased method for estimation of gene-by-environment interaction effects on biobank-scale datasets

  2023cites this paper
• Reinforcement learning based coarse-to-fine search for the maximum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e8407" altimg="si266.svg"><mml:mi>k</mml:mi></mml:math>-plex problem

  2022cites this paper
• A novel temporal recommendation method based on user query topic evolution

  2022cites this paper
• A comparative study of GPU metaheuristics for data clustering

  2021cites this paper
• Iterated local search with tabu search for the weighted vertex coloring problem

  2021cites this paper
• A versatile, fast and unbiased method for estimation of gene-by-environment interaction effects on biobank-scale datasets

  2021cites this paper
• A FPGA-based accelerated architecture for the Continuous GRASP

  2020influential citation
• Iterated local search for the generalized independent set problem

  2020cites this paper
• Continuous cubic formulations for cluster detection problems in networks

  2020cites this paper
• Testing a Heuristic Algorithm for Finding a Maximum Clique on DIMACS and Facebook Graphs

  2020cites this paper
• Accelerating continuous GRASP with a GPU

  2019cites this paper