On the public citation graph
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
0 signed · 56 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.1002/widm.1178openalex-snapshot
Community detection in social networks
inferredcites →https://doi.org/10.1007/3-540-45995-2_51openalex-snapshot
Massive Quasi-Clique Detection
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-319-53925-6_1openalex-snapshot
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
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/s00778-013-0340-zopenalex-snapshot
Dense subgraph maintenance under streaming edge weight updates for real-time story identification
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/s10107-020-01572-4openalex-snapshot
Continuous cubic formulations for cluster detection problems in networks
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.1016/0167-6377(90)90057-copenalex-snapshot
An exact algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
inferredcites →https://doi.org/10.1016/0378-8733(83)90028-xopenalex-snapshot
Network structure and minimum degree
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.2016.09.039openalex-snapshot
Maximum weight relaxed cliques and Russian Doll Search revisited
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.future.2015.01.001openalex-snapshot
A survey of anomaly detection techniques in financial domain
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.1017/cbo9781107279667.013openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1080/15427951.2014.986778openalex-snapshot
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
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.1109/tc.1986.1676847openalex-snapshot
An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
inferredcites →https://doi.org/10.1137/14100018xopenalex-snapshot
Parallel Maximum Clique Algorithms with Applications to Network Analysis
inferredcites →https://doi.org/10.1145/2402.322385openalex-snapshot
Smallest-last ordering and clustering and graph coloring algorithms
inferredcites →https://doi.org/10.1145/3292500.3330986openalex-snapshot
Efficient Maximum Clique Computation over Large Sparse Graphs
inferredcites →https://doi.org/10.1145/3511808.3557444openalex-snapshot
Scaling Up Maximal k -plex Enumeration
inferredcites →https://doi.org/10.1145/800133.804355openalex-snapshot
Node-and edge-deletion NP-complete problems
inferredcites →https://doi.org/10.1287/ijoc.2020.0984openalex-snapshot
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
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.1287/trsc.36.4.378.546openalex-snapshot
An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations
inferredcites →https://doi.org/10.1371/journal.pcbi.1003814openalex-snapshot
Characterizing Protein Interactions Employing a Genome-Wide siRNA Cellular Phenotyping Screen
inferredcites →https://doi.org/10.14778/2311906.2311909openalex-snapshot
Truss decomposition in massive networks
inferredcites →https://doi.org/10.14778/3407790.3407843openalex-snapshot
Ordering heuristics for k -clique listing
inferredcites →https://doi.org/10.1609/aaai.v34i03.5625openalex-snapshot
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s42979-025-04271-zopenalex-snapshot
An Efficient Seed-Initialized Algorithm for Maximal Clique Enumeration and Its Applications
inferred← citeshttps://doi.org/10.1007/s44443-025-00391-xopenalex-snapshot
Mining Interaction-intensive cores in temporal graphs
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.1016/j.knosys.2026.116522openalex-snapshot
A branch-and-bound approach for maximum low-diameter dense subgraph problems
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00277openalex-snapshot
Identifying Maximum Defective Bicliques in Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00189openalex-snapshot
SQAC: Scalable Querying of Attribute-Constrained (α, β)-Cores over Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/3677142openalex-snapshot
Theoretically and Practically Efficient Maximum Defective Clique Search
inferred← citeshttps://doi.org/10.1145/3709687openalex-snapshot
Efficient Maximum s -Bundle Search via Local Vertex Connectivity
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/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.1145/3837110openalex-snapshot
Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs
inferred← citeshttps://doi.org/10.14778/3705829.3705839openalex-snapshot
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
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
inferred← citeshttps://doi.org/10.2139/ssrn.5768076openalex-snapshot
An efficient local search algorithm with frequency based configuration checking strategy for the maximum weighted k-plex problem
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.