On the public citation graph
Mining Largest Maximal Quasi-Cliques
0 signed · 82 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/net.21791openalex-snapshot
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
inferredcites →https://doi.org/10.1007/11823728_42openalex-snapshot
Efficient Mining of Large Maximal Bicliques
inferredcites →https://doi.org/10.1007/3-540-44436-x_10openalex-snapshot
Greedy Approximation Algorithms for Finding Dense Components in a Graph
inferredcites →https://doi.org/10.1007/3-540-45995-2openalex-snapshot
LATIN 2002: Theoretical Informatics
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-3-030-60796-8_45openalex-snapshot
Dense Subgraphs Summarization: An Efficient Way to Summarize Large Scale Graphs by Super Nodes
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_23openalex-snapshot
New Algorithms for Enumerating All Maximal Cliques
inferredcites →https://doi.org/10.1007/978-3-540-77120-3_36openalex-snapshot
An Efficient Algorithm for Enumerating Pseudo Cliques
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-95995-3_3openalex-snapshot
Finding Dense Subgraphs with Size Bounds
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_50openalex-snapshot
On Finding Dense Subgraphs
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/s10618-016-0464-zopenalex-snapshot
Top-k overlapping densest subgraphs
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/j.cie.2019.04.040openalex-snapshot
An extension of adaptive multi-start tabu search for the maximum quasi-clique problem
inferredcites →https://doi.org/10.1016/j.dam.2003.09.004openalex-snapshot
Consensus algorithms for the generation of all maximal bicliques
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.2019.01.032openalex-snapshot
Dense subgraphs in random graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2014.08.011openalex-snapshot
Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes
inferredcites →https://doi.org/10.1016/j.metabol.2014.10.030openalex-snapshot
Biomarkers of Parkinson’s disease: Present and future
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/s0304-3975(98)00091-7openalex-snapshot
Classifying molecular sequences using a linkage graph with their pairwise similarities
inferredcites →https://doi.org/10.1038/npre.2012.7125openalex-snapshot
Mining the Largest Quasi-clique in Human Protein Interactome
inferredcites →https://doi.org/10.1073/pnas.2032324100openalex-snapshot
Protein complexes and functional modules in molecular networks
inferredcites →https://doi.org/10.1080/0022250x.1973.9989826openalex-snapshot
A graph‐theoretic definition of a sociometric clique†
inferredcites →https://doi.org/10.1086/229972openalex-snapshot
The Sociological Concept of "Group": An Empirical Test of Two Models
inferredcites →https://doi.org/10.1089/cmb.2017.0037openalex-snapshot
Detection of Complexes in Biological Networks Through Diversified Dense Subgraph Mining
inferredcites →https://doi.org/10.1109/bigdata.2014.7004366openalex-snapshot
ParK: An efficient algorithm for k-core decomposition on multicore processors
inferredcites →https://doi.org/10.1109/bigdata.2018.8622352openalex-snapshot
Enumerating Top-k Quasi-Cliques
inferredcites →https://doi.org/10.1109/hipc.2018.00016openalex-snapshot
Shared-Memory Parallel Maximal Clique Enumeration
inferredcites →https://doi.org/10.1109/icde.2010.5447891openalex-snapshot
Finding top-k maximal cliques in an uncertain graph
inferredcites →https://doi.org/10.1109/icde.2011.5767911openalex-snapshot
Efficient core decomposition in massive networks
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/icdm.2010.95openalex-snapshot
Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms
inferredcites →https://doi.org/10.1109/tkde.2010.271openalex-snapshot
Dense Subgraph Extraction with Application to Community Detection
inferredcites →https://doi.org/10.1109/tkde.2016.2527643openalex-snapshot
Enumeration of Maximal Cliques from an Uncertain Graph
inferredcites →https://doi.org/10.1109/tsc.2016.2523997openalex-snapshot
Enumerating Maximal Bicliques from a Large Graph Using MapReduce
inferredcites →https://doi.org/10.1111/itor.12637openalex-snapshot
An exact algorithm for the maximum quasi‐clique problem
inferredcites →https://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1145/1081870.1081898openalex-snapshot
On mining cross-graph quasi-cliques
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/2339530.2339726openalex-snapshot
Mining coherent subgraphs in multi-layer graphs with edge labels
inferredcites →https://doi.org/10.1145/2487575.2487645openalex-snapshot
Denser than the densest subgraph
inferredcites →https://doi.org/10.1145/2684822.2685298openalex-snapshot
Finding Subgraphs with Maximum Total Density and Limited Overlap
inferredcites →https://doi.org/10.1145/2723372.2746478openalex-snapshot
Efficient Enumeration of Maximal k-Plexes
inferredcites →https://doi.org/10.1145/2736277.2741098openalex-snapshot
The K-clique Densest Subgraph Problem
inferredcites →https://doi.org/10.1145/2783258.2783385openalex-snapshot
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
inferredcites →https://doi.org/10.1145/3097983.3098031openalex-snapshot
Fast Enumeration of Large k-Plexes
inferredcites →https://doi.org/10.1145/3219819.3220097openalex-snapshot
Butterfly Counting in Bipartite Networks
inferredcites →https://doi.org/10.1145/3237191openalex-snapshot
Enumerating Trillion Subgraphs On Distributed Systems
inferredcites →https://doi.org/10.1145/3380936openalex-snapshot
Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected 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.1371/journal.pone.0051883openalex-snapshot
Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably “Explosive”
inferredcites →https://doi.org/10.14778/2140436.2140443openalex-snapshot
Mining attribute-structure correlated patterns in large attributed graphs
inferredcites →https://doi.org/10.14778/2168651.2168658openalex-snapshot
Dense subgraph maintenance under streaming edge weight updates for real-time story identification
inferredcites →https://doi.org/10.14778/2850469.2850471openalex-snapshot
K-core decomposition of large networks on a single PC
inferredcites →https://doi.org/10.3390/a9010021openalex-snapshot
Multivariate Algorithmics for Finding Cohesive Subnetworks
inferredcites →https://doi.org/10.3390/ijms17060862openalex-snapshot
Review on Graph Clustering and Subgraph Similarity Based Analysis of Neurological Disorders
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-70626-4_6openalex-snapshot
A Recursive Approach for Maximal ($$\varDelta , \gamma $$)-Clique Enumeration in Temporal Networks
inferred← citeshttps://doi.org/10.1007/s00778-026-00966-8openalex-snapshot
DIST: Efficient k-Clique Listing via Induced Subgraph Trie
inferred← citeshttps://doi.org/10.1007/s10479-023-05609-7openalex-snapshot
A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
inferred← citeshttps://doi.org/10.1007/s10618-025-01164-wopenalex-snapshot
Indexing demand response potential at multiple temporal granularity using network theory based analysis
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121816openalex-snapshot
DeepDense: Enabling node embedding to dense subgraph mining
inferred← citeshttps://doi.org/10.1016/j.ins.2022.08.073openalex-snapshot
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study
inferred← citeshttps://doi.org/10.1016/j.ins.2022.11.043openalex-snapshot
Listing maximal k-relaxed-vertex connected components from large graphs
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.1049/ell2.12685openalex-snapshot
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
inferred← citeshttps://doi.org/10.1109/tcss.2022.3224935openalex-snapshot
Diversity-Optimized Group Extraction in Social Networks
inferred← citeshttps://doi.org/10.1111/itor.13299openalex-snapshot
MIP formulations for induced graph optimization problems: a tutorial
inferred← citeshttps://doi.org/10.1145/3591468openalex-snapshot
Computing Graph Descriptors on Edge Streams
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/3711896.3737041openalex-snapshot
Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
inferred← citeshttps://doi.org/10.1145/3779064openalex-snapshot
Polarized Communities Meet Densest Subgraph: Efficient and Effective Polarization Detection in Signed Networks
inferred← citeshttps://doi.org/10.1145/3786618openalex-snapshot
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28695openalex-snapshot
Social-Aware Group Display Configuration in VR Conference
inferred← citeshttps://doi.org/10.32657/10356/171775openalex-snapshot
Cohesive subgraph mining in large graphs
inferred← citeshttps://doi.org/10.70675/da7b772aza572z4b78z89c4zbce8fd9f8095openalex-snapshot
Anomaly Detection in Graph Streams
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.