On the public citation graph
An efficient local search algorithm with frequency based configuration checking strategy for the maximum weighted k-plex problem
0 signed · 18 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-387-30165-5_30openalex-snapshot
Graph Domination, Coloring and Cliques in Telecommunications
inferredcites →https://doi.org/10.1007/s10479-012-1124-3openalex-snapshot
Multi-neighborhood tabu search for the maximum weight clique problem
inferredcites →https://doi.org/10.1007/s10479-019-03159-5openalex-snapshot
A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems
inferredcites →https://doi.org/10.1007/s10589-013-9548-5openalex-snapshot
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
inferredcites →https://doi.org/10.1007/s10732-020-09459-5openalex-snapshot
Local search for the maximum k-plex problem
inferredcites →https://doi.org/10.1007/s10878-010-9338-2openalex-snapshot
Combinatorial algorithms for the maximum k-plex problem
inferredcites →https://doi.org/10.1016/j.artint.2011.03.003openalex-snapshot
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
inferredcites →https://doi.org/10.1016/j.compeleceng.2015.07.022openalex-snapshot
A multi-level clustering scheme based on cliques and clusters for wireless sensor networks
inferredcites →https://doi.org/10.1016/j.ejor.2019.02.028openalex-snapshot
The maximum clique interdiction problem
inferredcites →https://doi.org/10.1016/s0377-2217(01)00133-3openalex-snapshot
An exact algorithm for the maximum k-club problem in an undirected graph
inferredcites →https://doi.org/10.1080/0022250x.1978.9989883openalex-snapshot
A graph‐theoretic generalization of the clique concept
inferredcites →https://doi.org/10.1109/access.2019.2934470openalex-snapshot
A Swap-Based Heuristic Algorithm for the Maximum $k$ -Plex Problem
inferredcites →https://doi.org/10.1145/3617313openalex-snapshot
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
inferredcites →https://doi.org/10.1145/3639318openalex-snapshot
Maximum k-Plex Computation: Theory and Practice
inferredcites →https://doi.org/10.1287/opre.1100.0851openalex-snapshot
Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem
inferredcites →https://doi.org/10.14778/3565816.3565817openalex-snapshot
Efficient maximum k -plex computation over large sparse graphs
inferredcites →https://doi.org/10.1609/aaai.v34i03.5613openalex-snapshot
Local Search with Dynamic-Threshold Configuration Checking and Incremental Neighborhood Updating for Maximum k-plex Problem
inferredcites →https://doi.org/10.1609/aaai.v35i14.17477openalex-snapshot
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.