On the public citation graph

Theoretically and Practically Efficient Maximum Defective Clique Search

0 signed · 66 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.21791openalex-snapshot
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
inferredcites →https://doi.org/10.1002/widm.1178openalex-snapshot
Community detection in social networks
inferredcites →https://doi.org/10.1007/978-1-4419-8462-3openalex-snapshot
Social Network Data Analytics
inferredcites →https://doi.org/10.1007/978-1-4614-0857-4openalex-snapshot
Handbook of Optimization in Complex Networks: Communication and Social Networks
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial 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-319-25730-3openalex-snapshot
A Guide to Graph Colouring: Algorithms and Applications
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-642-11440-3_18openalex-snapshot
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
inferredcites →https://doi.org/10.1007/978-3-642-17517-6_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
inferredcites →https://doi.org/10.1007/bf00139635openalex-snapshot
Cliques, clubs and clans
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/bf02289199openalex-snapshot
Connectivity and Generalized Cliques in Sociometric Group Structure
inferredcites →https://doi.org/10.1007/s00778-020-00602-zopenalex-snapshot
Efficient maximum clique computation and enumeration over large sparse graphs
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/s10589-013-9548-5openalex-snapshot
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
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-010-9338-2openalex-snapshot
Combinatorial algorithms for the maximum k-plex problem
inferredcites →https://doi.org/10.1007/s10878-011-9391-5openalex-snapshot
Exact combinatorial algorithms and experiments for finding maximum k-plexes
inferredcites →https://doi.org/10.1007/s10898-006-9039-7openalex-snapshot
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
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.cor.2015.07.013openalex-snapshot
A new exact maximum clique algorithm for large and massive sparse graphs
inferredcites →https://doi.org/10.1016/j.cor.2017.02.017openalex-snapshot
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
inferredcites →https://doi.org/10.1016/j.cor.2020.105131openalex-snapshot
Computing maximum k-defective cliques in massive graphs
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.dam.2016.09.039openalex-snapshot
Maximum weight relaxed cliques and Russian Doll Search revisited
inferredcites →https://doi.org/10.1016/j.dam.2020.02.003openalex-snapshot
LP-based dual bounds for the maximum quasi-clique problem
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.tcs.2006.06.015openalex-snapshot
The worst-case time complexity for generating all maximal cliques and computational experiments
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.016openalex-snapshot
Refined pivot selection for maximal clique enumeration in graphs
inferredcites →https://doi.org/10.1080/0022250x.1978.9989883openalex-snapshot
A graph‐theoretic generalization of the clique concept
inferredcites →https://doi.org/10.1093/bioinformatics/btl014openalex-snapshot
Predicting interactions in protein networks by completing defective cliques
inferredcites →https://doi.org/10.1109/ictai.2013.143openalex-snapshot
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem
inferredcites →https://doi.org/10.1111/itor.12637openalex-snapshot
An exact algorithm for the maximum quasi‐clique problem
inferredcites →https://doi.org/10.1137/14100018xopenalex-snapshot
Parallel Maximum Clique Algorithms with Applications to Network Analysis
inferredcites →https://doi.org/10.1145/1132516.1132612openalex-snapshot
Linear degree extractors and the inapproximability of max clique and chromatic number
inferredcites →https://doi.org/10.1145/1348549.1348552openalex-snapshot
Community detection in large-scale social networks
inferredcites →https://doi.org/10.1145/2428556.2428575openalex-snapshot
Exact exponential algorithms
inferredcites →https://doi.org/10.1145/335168.335170openalex-snapshot
The Web as a graph
inferredcites →https://doi.org/10.1145/3588931openalex-snapshot
Maximal Defective Clique Enumeration
inferredcites →https://doi.org/10.1145/3617313openalex-snapshot
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.1145/800133.804355openalex-snapshot
Node-and edge-deletion NP-complete problems
inferredcites →https://doi.org/10.1287/ijoc.2019.0922openalex-snapshot
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
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.v24i1.7536openalex-snapshot
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
inferredcites →https://doi.org/10.1609/aaai.v31i1.10655openalex-snapshot
A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis
inferredcites →https://doi.org/10.1609/aaai.v35i14.17477openalex-snapshot
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding
inferredcites →https://doi.org/10.1609/aaai.v36i9.21257openalex-snapshot
An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs
inferredcites →https://doi.org/10.2197/ipsjjip.25.667openalex-snapshot
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments
inferredcites →https://doi.org/10.24963/ijcai.2018/201openalex-snapshot
An Exact Algorithm for Maximum k-Plexes in Massive Graphs
inferredcites →https://doi.org/10.24963/ijcai.2021/233openalex-snapshot
A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem
inferredcites →https://doi.org/10.4153/cjm-1970-125-1openalex-snapshot
k -Degenerate Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.ejor.2026.07.036openalex-snapshot
Exact clique number manipulation via edge interdiction
inferred← citeshttps://doi.org/10.1016/j.ins.2026.124227openalex-snapshot
Leveraging concept-cognitive learning to identify maximum s-defective cliques in network systems
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00210openalex-snapshot
Maximum Balanced Clique Search on Large Directed Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2025.3631112openalex-snapshot
Pseudoarboricity-Based Skyline Important Community Search in Large Networks
inferred← citeshttps://doi.org/10.1145/3709687openalex-snapshot
Efficient Maximum s -Bundle Search via Local Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/3769789openalex-snapshot
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements
inferred← citeshttps://doi.org/10.1145/3774904.3792114openalex-snapshot
Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks
inferred← citeshttps://doi.org/10.1145/3786618openalex-snapshot
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/3802103openalex-snapshot
Querying Cohesive Subgraphs in Temporal Graphs
inferred← citeshttps://doi.org/10.14778/3819518.3819562openalex-snapshot
Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound
inferred← citeshttps://doi.org/10.14778/3836663.3836687openalex-snapshot
Maximum Defective Biclique Search in Large Bipartite Graphs
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.