On the public citation graph

On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches

0 signed · 84 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.21620openalex-snapshot
On provably best construction heuristics for hard combinatorial optimization problems
inferredcites →https://doi.org/10.1002/net.21622openalex-snapshot
Critical nodes for distance‐based connectivity and related problems in graphs
inferredcites →https://doi.org/10.1007/3-540-45995-2_51openalex-snapshot
Massive Quasi-Clique Detection
inferredcites →https://doi.org/10.1007/978-0-387-30165-5openalex-snapshot
Handbook of Optimization in Telecommunications
inferredcites →https://doi.org/10.1007/978-1-4419-6045-0openalex-snapshot
Managing and Mining Graph Data
inferredcites →https://doi.org/10.1007/978-1-4419-6045-0_10openalex-snapshot
A Survey of Algorithms for Dense Subgraph Discovery
inferredcites →https://doi.org/10.1007/978-1-4419-7997-1_68openalex-snapshot
Fuzzy Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferredcites →https://doi.org/10.1007/978-3-540-31955-9_6openalex-snapshot
Local Density
inferredcites →https://doi.org/10.1007/978-3-540-87481-2_3openalex-snapshot
Effective Pruning Techniques for Mining Quasi-Cliques
inferredcites →https://doi.org/10.1007/978-3-540-92695-5_4openalex-snapshot
On Effectively Finding Maximal Quasi-cliques in Graphs
inferredcites →https://doi.org/10.1007/bf01098364openalex-snapshot
The maximum clique problem
inferredcites →https://doi.org/10.1007/bf02289146openalex-snapshot
A Method of Matrix Analysis of Group Structure
inferredcites →https://doi.org/10.1007/s10479-012-1242-yopenalex-snapshot
A branch-and-bound approach for maximum quasi-cliques
inferredcites →https://doi.org/10.1007/s10479-015-1992-4openalex-snapshot
On robust clusters of minimum cardinality in networks
inferredcites →https://doi.org/10.1007/s10589-015-9804-yopenalex-snapshot
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
inferredcites →https://doi.org/10.1007/s10878-005-1857-xopenalex-snapshot
Novel Approaches for Analyzing Biological Networks
inferredcites →https://doi.org/10.1007/s11590-013-0698-2openalex-snapshot
Solving maximum clique in sparse graphs: an $$O(nm+n2^{d/4})$$ O ( n m + n 2 d / 4 ) algorithm for $$d$$ d -degenerate graphs
inferredcites →https://doi.org/10.1007/s11590-014-0782-2openalex-snapshot
An integer programming approach for finding the most and the least central cliques
inferredcites →https://doi.org/10.1016/0167-6377(90)90057-copenalex-snapshot
An exact algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/j.cor.2005.01.027openalex-snapshot
Mining market data: A network approach
inferredcites →https://doi.org/10.1016/j.csda.2004.02.004openalex-snapshot
Statistical analysis of financial networks
inferredcites →https://doi.org/10.1016/j.dam.2012.03.025openalex-snapshot
On the approximability of some degree-constrained subgraph problems
inferredcites →https://doi.org/10.1016/j.dam.2012.07.019openalex-snapshot
On the maximum quasi-clique problem
inferredcites →https://doi.org/10.1016/j.ejor.2005.05.026openalex-snapshot
Clique-detection models in computational biochemistry and genomics
inferredcites →https://doi.org/10.1016/j.ejor.2012.10.021openalex-snapshot
On clique relaxation models in network analysis
inferredcites →https://doi.org/10.1016/j.ejor.2014.05.041openalex-snapshot
Finding maximum subgraphs with relatively large vertex connectivity
inferredcites →https://doi.org/10.1016/j.ejor.2014.09.064openalex-snapshot
A review on algorithms for maximum clique problems
inferredcites →https://doi.org/10.1016/s0304-3975(98)00091-7openalex-snapshot
Classifying molecular sequences using a linkage graph with their pairwise similarities
inferredcites →https://doi.org/10.1080/0022250x.1978.9989883openalex-snapshot
A graph‐theoretic generalization of the clique concept
inferredcites →https://doi.org/10.1080/15427951.2004.10129089openalex-snapshot
The Spectra of Random Graphs with Given Expected Degrees
inferredcites →https://doi.org/10.1090/dimacs/050/06openalex-snapshot
On maximum clique problems in very large graphs
inferredcites →https://doi.org/10.1093/acprof:oso/9780199206650.001.0001openalex-snapshot
Networks: An Introduction
inferredcites →https://doi.org/10.1103/revmodphys.74.47openalex-snapshot
Statistical mechanics of complex networks
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/icdm.2006.111openalex-snapshot
Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment
inferredcites →https://doi.org/10.1109/isda.2009.75openalex-snapshot
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Detection
inferredcites →https://doi.org/10.1145/1150402.1150506openalex-snapshot
Coherent closed quasi-clique discovery from large dense graph databases
inferredcites →https://doi.org/10.1145/1242524.1242530openalex-snapshot
Out-of-core coherent closed quasi-clique mining from large dense graph databases
inferredcites →https://doi.org/10.1145/1460797.1460799openalex-snapshot
Mining frequent cross-graph quasi-cliques
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2402.322385openalex-snapshot
Smallest-last ordering and clustering and graph coloring algorithms
inferredcites →https://doi.org/10.1287/ijoc.2014.0618openalex-snapshot
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
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.1371/journal.pone.0051883openalex-snapshot
Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably “Explosive”
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.2307/j.ctvcm4gh1openalex-snapshot
Social and Economic Networks
inferredcites →https://doi.org/10.3390/a9010021openalex-snapshot
Multivariate Algorithmics for Finding Cohesive Subnetworks
inferredcites →https://doi.org/10.4135/9781036236021openalex-snapshot
Analyzing Social Networks
inferredcites →https://doi.org/10.5486/pmd.1959.6.3-4.12openalex-snapshot
On random graphs. I.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/aic.17051openalex-snapshot
Networks of materials: Construction and structural analysis
inferred← citeshttps://doi.org/10.1002/net.22248openalex-snapshot
A survey on optimization studies of group centrality metrics
inferred← citeshttps://doi.org/10.1007/s10589-024-00640-1openalex-snapshot
Ultra-small world detection in networks: subgraphs with prescribed distance distributions
inferred← citeshttps://doi.org/10.1007/s11590-023-01975-0openalex-snapshot
On atomic cliques in temporal graphs
inferred← citeshttps://doi.org/10.1007/s41109-019-0228-yopenalex-snapshot
Graph-based exploration and clustering analysis of semantic spaces
inferred← citeshttps://doi.org/10.1016/j.cie.2019.04.040openalex-snapshot
An extension of adaptive multi-start tabu search for the maximum quasi-clique problem
inferred← citeshttps://doi.org/10.1016/j.dam.2020.02.003openalex-snapshot
LP-based dual bounds for the maximum quasi-clique problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.07.042openalex-snapshot
On the maximum small-world subgraph problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.03.019openalex-snapshot
An opposition-based memetic algorithm for the maximum quasi-clique problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.05.010openalex-snapshot
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.engappai.2019.03.015openalex-snapshot
Dynamic thresholding search for minimum vertex cover in massive sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2021.06.094openalex-snapshot
Solving maximum quasi-clique problem by a hybrid artificial bee colony approach
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106105openalex-snapshot
Hardness and tractability of the γ-Complete Subgraph problem
inferred← citeshttps://doi.org/10.1049/ell2.12685openalex-snapshot
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
inferred← citeshttps://doi.org/10.1051/ro/2020003openalex-snapshot
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
inferred← citeshttps://doi.org/10.1089/cmb.2019.0171openalex-snapshot
A Graph-Based Approach for Finding the Dengue Infection Pathways in Humans Using Protein–Protein Interactions
inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622352openalex-snapshot
Enumerating Top-k Quasi-Cliques
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11401709openalex-snapshot
GPU-Accelerated Maximal Quasi-Clique Mining
inferred← citeshttps://doi.org/10.1134/s1064226922140042openalex-snapshot
On the Clique Partitioning of a Graph
inferred← citeshttps://doi.org/10.1145/3446637openalex-snapshot
Mining Largest Maximal Quasi-Cliques
inferred← citeshttps://doi.org/10.1145/3617331openalex-snapshot
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
inferred← citeshttps://doi.org/10.1145/3637528.3672066openalex-snapshot
A Fast Exact Algorithm to Enumerate Maximal Pseudo-cliques in Large Sparse Graphs
inferred← citeshttps://doi.org/10.1145/3677142openalex-snapshot
Theoretically and Practically Efficient Maximum Defective Clique Search
inferred← citeshttps://doi.org/10.1145/3711896.3737041openalex-snapshot
Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
inferred← citeshttps://doi.org/10.1145/3774904.3792114openalex-snapshot
Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks
inferred← citeshttps://doi.org/10.1145/3805712.3809542openalex-snapshot
Cohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
inferred← citeshttps://doi.org/10.1145/3806834openalex-snapshot
Maximal Balanced Quasi-Clique Enumeration in Signed Graphs
inferred← citeshttps://doi.org/10.1145/3837110openalex-snapshot
Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17455openalex-snapshot
NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem
inferred← citeshttps://doi.org/10.2139/ssrn.7330469openalex-snapshot
Vertex Partitions under Size-Adaptive Degree Constraints
inferred← citeshttps://doi.org/10.32657/10356/171775openalex-snapshot
Cohesive subgraph mining in large graphs
inferred← citeshttps://doi.org/10.3390/math14081298openalex-snapshot
Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2109.08902openalex-snapshot
Convex Formulation for Planted Quasi-Clique Recovery
inferred← citeshttps://doi.org/10.7717/peerj-cs.2173openalex-snapshot
An optimization algorithm for maximum quasi-clique problem based on information feedback model
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.