On the public citation graph
The Enumeration of Maximal Cliques of Large Graphs
0 signed · 165 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.1109/tec.1959.5222697openalex-snapshot
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
inferredcites →https://doi.org/10.1145/321694.321698openalex-snapshot
Corrections to Bierstone's Algorithm for Generating Cliques
inferredcites →https://doi.org/10.1145/363242.363270openalex-snapshot
Scheduling university course examinations by computer
inferredcites →https://doi.org/10.1147/rd.85.0537openalex-snapshot
Derivation of Maximal Compatibles Using Boolean Algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118346990.ch10openalex-snapshot
Density‐Based Set Enumeration in Structured Data
inferred← citeshttps://doi.org/10.1002/zamm.19870670712openalex-snapshot
On a Class of High Order Methods for Inverting Matrices
inferred← citeshttps://doi.org/10.1007/978-1-4614-6729-8_12openalex-snapshot
Algorithms for Finding Motifs in Large Labeled Networks
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-36178-5_66openalex-snapshot
A New Genetic Algorithm for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-81885-2_6openalex-snapshot
Clique, Independent Set, and Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-030-86475-0_33openalex-snapshot
A Two-Phase Approach for Enumeration of Maximal $$(\varDelta , \gamma )$$-Cliques of a Temporal Network
inferred← citeshttps://doi.org/10.1007/978-3-030-90888-1_37openalex-snapshot
Updating Maximal $$(\varDelta , \gamma )$$-Cliques of a Temporal Network Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-031-69583-4_7openalex-snapshot
QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique
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/978-3-031-85628-0_2openalex-snapshot
Assessing Information Influence for Node Attribute Prediction
inferred← citeshttps://doi.org/10.1007/978-3-319-19644-2_9openalex-snapshot
A Platform for Matching Context in Real Time
inferred← citeshttps://doi.org/10.1007/978-3-319-32049-6_16openalex-snapshot
Parallelizing Maximal Clique Enumeration Over Graph Data
inferred← citeshttps://doi.org/10.1007/978-3-642-03973-7_16openalex-snapshot
On Containment of Conjunctive Queries with Negation
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_10openalex-snapshot
On the Containment Problem for Queries in Conjunctive Form with Negation
inferred← citeshttps://doi.org/10.1007/978-3-642-13601-6_7openalex-snapshot
A Model for Detecting “Global Footprint Anomalies” in a Grid Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
inferred← citeshttps://doi.org/10.1007/978-3-642-20841-6_29openalex-snapshot
Mining Maximal Co-located Event Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-36505-8_7openalex-snapshot
Maximal Clique Enumeration in Finding Near Neighbourhoods
inferred← citeshttps://doi.org/10.1007/978-3-642-41299-8_24openalex-snapshot
GPU Implementation of MCE Approach to Finding Near Neighbourhoods
inferred← citeshttps://doi.org/10.1007/978-3-642-68826-3_3openalex-snapshot
Symbolic Description and Matching of Image Sequences
inferred← citeshttps://doi.org/10.1007/978-3-662-04921-1_6openalex-snapshot
Clique, Independent Set, and Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-981-95-3906-2_11openalex-snapshot
Efficient Maximal Frequent Clique Enumeration in Multilayer Networks
inferred← citeshttps://doi.org/10.1007/bf00991836openalex-snapshot
Cliques of a graph-variations on the Bron-Kerbosch algorithm
inferred← citeshttps://doi.org/10.1007/bf01874394openalex-snapshot
The density function of the number of moves to complete the Towers of Hanoi puzzle
inferred← citeshttps://doi.org/10.1007/bf02277184openalex-snapshot
A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
inferred← citeshttps://doi.org/10.1007/bfb0054753openalex-snapshot
Automatic detection and labelling of the human cortical folds in magnetic resonance data sets
inferred← citeshttps://doi.org/10.1007/s00453-012-9632-8openalex-snapshot
Fast Maximal Cliques Enumeration in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00656-8openalex-snapshot
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
inferred← citeshttps://doi.org/10.1007/s00778-015-0408-zopenalex-snapshot
Diversified top-k clique search
inferred← citeshttps://doi.org/10.1007/s10618-017-0491-4openalex-snapshot
Micro-review synthesis for multi-entity summarization
inferred← citeshttps://doi.org/10.1007/s10618-021-00805-0openalex-snapshot
Generalized core maintenance of dynamic bipartite graphs
inferred← citeshttps://doi.org/10.1007/s10951-025-00860-1openalex-snapshot
A study of different preemption types to facilitate the recovery of personnel task schedules
inferred← citeshttps://doi.org/10.1007/s11227-019-02770-4openalex-snapshot
Listing all maximal cliques in large graphs on vertex-centric model
inferred← citeshttps://doi.org/10.1007/s11280-020-00788-wopenalex-snapshot
Personalized top-n influential community search over large social networks
inferred← citeshttps://doi.org/10.1007/s11704-009-0045-zopenalex-snapshot
Evaluation of subgraph searching algorithms detecting network motif in biological networks
inferred← citeshttps://doi.org/10.1007/s11750-024-00684-wopenalex-snapshot
A bisection method for solving distance-based clustering problems globally
inferred← citeshttps://doi.org/10.1007/s13278-024-01207-yopenalex-snapshot
A two-phase approach for enumeration of maximal $$(\Delta , \gamma )$$-cliques of a temporal network
inferred← citeshttps://doi.org/10.1007/s41019-017-0033-5openalex-snapshot
Efficient Maximal Clique Enumeration Over Graph Data
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90054-xopenalex-snapshot
Some observations on the determination of an upper bound for the clique number of a graph
inferred← citeshttps://doi.org/10.1016/0031-3203(84)90043-8openalex-snapshot
Image sequence analysis using relational structures
inferred← citeshttps://doi.org/10.1016/0031-3203(86)90029-4openalex-snapshot
Labeled point pattern matching by Delaunay triangulation and maximal cliques
inferred← citeshttps://doi.org/10.1016/0898-1221(83)90115-3openalex-snapshot
A new backtracking algorithm for generating the family of maximal independent sets of a graph
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50019-8openalex-snapshot
Complementary Approaches to CNF Boolean Equations
inferred← citeshttps://doi.org/10.1016/j.amc.2014.12.011openalex-snapshot
Computing Banzhaf–Coleman and Shapley–Shubik power indices with incompatible players
inferred← citeshttps://doi.org/10.1016/j.cor.2019.104867openalex-snapshot
Local search for diversified Top-k clique search 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.dam.2020.05.027openalex-snapshot
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.08.059openalex-snapshot
CLICOM: Cliques for combining multiple clusterings
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104464openalex-snapshot
Large-scale clique cover of real-world networks
inferred← citeshttps://doi.org/10.1016/j.ins.2014.09.032openalex-snapshot
Finding quasi core with simulated stacked neural networks
inferred← citeshttps://doi.org/10.1016/j.ins.2026.123905openalex-snapshot
Towards structure-aware AI: modeling and analyzing directed balanced cliques in signed graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.04.003openalex-snapshot
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
inferred← citeshttps://doi.org/10.1016/j.jda.2014.07.004openalex-snapshot
Unranking of small combinations from large sets
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.01.003openalex-snapshot
A scalable, parallel algorithm for maximal clique enumeration
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.03.003openalex-snapshot
Parallelizing maximal clique and k-plex enumeration over graph data
inferred← citeshttps://doi.org/10.1016/j.parco.2019.05.005openalex-snapshot
A memory efficient maximal clique enumeration method for sparse graphs with a parallel implementation
inferred← citeshttps://doi.org/10.1016/j.physa.2022.128391openalex-snapshot
Exploring the topological characteristics of urban trip networks based on taxi trajectory data
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.119openalex-snapshot
Context-aware Dynamic Data-driven Pattern Classification
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.010openalex-snapshot
A note on the problem of reporting maximal cliques
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.011openalex-snapshot
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00286-3openalex-snapshot
Enumerating all connected maximal common subgraphs in two graphs
inferred← citeshttps://doi.org/10.1038/s41598-022-22688-xopenalex-snapshot
Evolutionarily conserved gene expression patterns for affective disorders revealed using cross-species brain transcriptomic analyses in humans, rats and zebrafish
inferred← citeshttps://doi.org/10.1063/5.0096009openalex-snapshot
Information evolution in complex networks
inferred← citeshttps://doi.org/10.1080/02522667.1996.10699304openalex-snapshot
Distributed algorithms for maximum cliques
inferred← citeshttps://doi.org/10.1080/07391102.2020.1810777openalex-snapshot
A database of integrated molecular and phytochemical interactions of the foxm1 pathway for lung cancer
inferred← citeshttps://doi.org/10.1093/bioinformatics/bth163openalex-snapshot
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
inferred← citeshttps://doi.org/10.1093/comnet/cnac027openalex-snapshot
An efficient updation approach for enumerating maximal (Δ,γ)-cliques of a temporal network
inferred← citeshttps://doi.org/10.1108/ria-09-2022-0226openalex-snapshot
Long-term robot manipulation task planning with scene graph and semantic knowledge
inferred← citeshttps://doi.org/10.1109/access.2020.2974580openalex-snapshot
Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks
inferred← citeshttps://doi.org/10.1109/access.2020.3006162openalex-snapshot
Evaluation of Centralized Reader Anti-Collision Protocols for Mobile RFID System Based on Maximum Independent Set: A Simulation Study
inferred← citeshttps://doi.org/10.1109/access.2021.3138857openalex-snapshot
Communication-Aware Consensus-Based Decentralized Task Allocation in Communication Constrained Environments
inferred← citeshttps://doi.org/10.1109/bia.1998.692384openalex-snapshot
Sulcal basins and sulcal strings as new concepts for describing the human cortical topography
inferred← citeshttps://doi.org/10.1109/bmsb53066.2021.9547093openalex-snapshot
Wireless Sensor or Access-Point Deployment Using Coverage-Area Maximization over Visibility Graph
inferred← citeshttps://doi.org/10.1109/bmsb62888.2024.10608341openalex-snapshot
Fine-Tuning Optimization of Small Language Models: A Novel Graph-Theoretical Approach for Efficient Prompt Engineering
inferred← citeshttps://doi.org/10.1109/ccnc.2019.8651867openalex-snapshot
Multi-Level Channel Valuations and Coalitional Subgames in Spatial Spectrum Reuse
inferred← citeshttps://doi.org/10.1109/cdc.2012.6427082openalex-snapshot
Distributed algorithms for optimal power flow problem
inferred← citeshttps://doi.org/10.1109/cnna.2005.1543168openalex-snapshot
Solving Max-Clique Using Cellular Neural Network
inferred← citeshttps://doi.org/10.1109/cscs.2013.56openalex-snapshot
Graph Matching for Context Recognition
inferred← citeshttps://doi.org/10.1109/dbkda.2009.23openalex-snapshot
A Strong Containment Problem for Queries in Conjunctive Form with Negation
inferred← citeshttps://doi.org/10.1109/drcn.2016.7470840openalex-snapshot
Detection of spatially-close fiber segments in optical networks
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254091openalex-snapshot
Constrained VCG Auction for Spatial Spectrum Reuse with Flexible Channel Evaluations
inferred← citeshttps://doi.org/10.1109/icc.2013.6654763openalex-snapshot
Scheduling of index coding with side information in multicarrier wireless systems
inferred← citeshttps://doi.org/10.1109/icde.2015.7113300openalex-snapshot
Diversified top-k clique search
inferred← citeshttps://doi.org/10.1109/icde.2019.00072openalex-snapshot
Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1109/icde.2019.00083openalex-snapshot
Efficient Maximal Spatial Clique Enumeration
inferred← citeshttps://doi.org/10.1109/icdmw.2006.33openalex-snapshot
Association Bundle - A New Pattern for Association Analysis
inferred← citeshttps://doi.org/10.1109/icdmw.2006.69openalex-snapshot
Efficiently Mining Maximal 1-complete Regions from Dense Datasets
inferred← citeshttps://doi.org/10.1109/icsec53205.2021.9684660openalex-snapshot
The phytochemicals drug discovery for diabetes by the maximal clique algorithm
inferred← citeshttps://doi.org/10.1109/ikt51791.2020.9345622openalex-snapshot
Distributed Learning Automata-Based Algorithm for Finding K-Clique in Complex Social Networks
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566987openalex-snapshot
Trading off distortion for delay for video transmissions in wireless networks
inferred← citeshttps://doi.org/10.1109/jproc.2020.2977595openalex-snapshot
A Tutorial on Clique Problems in Communications and Signal Processing
inferred← citeshttps://doi.org/10.1109/jsyst.2019.2912757openalex-snapshot
On-Demand Receiver-Centric Channel Allocation via Constrained VCG Auction for Spatial Spectrum Reuse
inferred← citeshttps://doi.org/10.1109/ldav.2017.8231847openalex-snapshot
Maximal clique enumeration with data-parallel primitives
inferred← citeshttps://doi.org/10.1109/medhocnet.2013.6767417openalex-snapshot
A social-based service discovery protocol for mobile Ad Hoc networks
inferred← citeshttps://doi.org/10.1109/padsw.2014.7097844openalex-snapshot
pbitMCE: A bit-based approach for maximal clique enumeration on multicore processors
inferred← citeshttps://doi.org/10.1109/proc.1979.11218openalex-snapshot
On clique generation using Boolean equations
inferred← citeshttps://doi.org/10.1109/secon.2010.5508240openalex-snapshot
On the Uplink Capacity of Hybrid Cellular Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/socialcom.2013.103openalex-snapshot
Towards Network Reduction on Big Data
inferred← citeshttps://doi.org/10.1109/synasc.2013.42openalex-snapshot
Context Matching for Ambient Intelligence Applications
inferred← citeshttps://doi.org/10.1109/tbdata.2022.3223644openalex-snapshot
Computing Significant Cliques in Large Labeled Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2874651openalex-snapshot
Constrained VCG Auction With Multi-Level Channel Valuations for Spatial Spectrum Reuse in Non-Symmetric Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3392797openalex-snapshot
Novel Graph-Theoretical Multiple Access-Point/Router Deployment Approach for Full Line-of-Sight Coverage Over Arbitrary Indoor Polygonal/Prismatic Areas
inferred← citeshttps://doi.org/10.1109/tkde.2013.2297929openalex-snapshot
Graft: An Efficient Graphlet Counting Method for Large Graph Analysis
inferred← citeshttps://doi.org/10.1109/tkde.2022.3225562openalex-snapshot
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
inferred← citeshttps://doi.org/10.1109/tpds.2021.3067053openalex-snapshot
Accelerating the Bron-Kerbosch Algorithm for Maximal Clique Enumeration Using GPUs
inferred← citeshttps://doi.org/10.1109/tsc.2015.2479225openalex-snapshot
Distributed Maximal Clique Computation and Management
inferred← citeshttps://doi.org/10.1134/s1064226915120177openalex-snapshot
Combinatorial clustering: Literature review, methods, examples
inferred← citeshttps://doi.org/10.1137/0205038openalex-snapshot
Theory of Output Set Assignments and Degree Switching Operations
inferred← citeshttps://doi.org/10.1137/0206036openalex-snapshot
A New Algorithm for Generating All the Maximal Independent Sets
inferred← citeshttps://doi.org/10.1137/17m1152206openalex-snapshot
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
inferred← citeshttps://doi.org/10.1142/s0218213025500022openalex-snapshot
The Maximum Influence k-Plex Problem and its Branch-and-Bound Algorithm
inferred← citeshttps://doi.org/10.1145/1458082.1458288openalex-snapshot
Large maximal cliques enumeration in sparse graphs
inferred← citeshttps://doi.org/10.1145/1807167.1807217openalex-snapshot
Finding maximal cliques in massive networks by H*-graph
inferred← citeshttps://doi.org/10.1145/2043652.2043654openalex-snapshot
Finding maximal cliques in massive networks
inferred← citeshttps://doi.org/10.1145/2339530.2339724openalex-snapshot
Fast algorithms for maximal clique enumeration with limited memory
inferred← citeshttps://doi.org/10.1145/2543629openalex-snapshot
Listing All Maximal Cliques in Large Sparse Real-World Graphs
inferred← citeshttps://doi.org/10.1145/2567634.2567640openalex-snapshot
Maximal clique enumeration for large graphs on hadoop framework
inferred← citeshttps://doi.org/10.1145/2723372.2746478openalex-snapshot
Efficient Enumeration of Maximal k-Plexes
inferred← citeshttps://doi.org/10.1145/2851613.2851816openalex-snapshot
Clique covering of large real-world networks
inferred← citeshttps://doi.org/10.1145/3038912.3052636openalex-snapshot
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
inferred← citeshttps://doi.org/10.1145/3297001.3297015openalex-snapshot
On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network
inferred← citeshttps://doi.org/10.1145/3336191.3371839openalex-snapshot
The Power of Pivoting for Exact Clique Counting
inferred← citeshttps://doi.org/10.1145/3359992.3366640openalex-snapshot
Comparing Machine Learning Algorithms for BGP Anomaly Detection using Graph Features
inferred← citeshttps://doi.org/10.1145/3366423.3380119openalex-snapshot
Efficient Maximal Balanced Clique Enumeration in Signed Networks
inferred← citeshttps://doi.org/10.1145/3386686openalex-snapshot
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
inferred← citeshttps://doi.org/10.1145/356631.356634openalex-snapshot
Binary Search Trees and File Organization
inferred← citeshttps://doi.org/10.1145/3650200.3656607openalex-snapshot
Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size
inferred← citeshttps://doi.org/10.1145/3690624.3709174openalex-snapshot
The k -Trine Cohesive Subgraph and Its Efficient Algorithms
inferred← citeshttps://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferred← citeshttps://doi.org/10.1147/jrd.2010.2081230openalex-snapshot
Discovery and analysis of tightly knit communities in telecom social networks
inferred← citeshttps://doi.org/10.1186/s13408-015-0027-4openalex-snapshot
The Minimal k-Core Problem for Modeling k-Assemblies
inferred← citeshttps://doi.org/10.14778/3137628.3137660openalex-snapshot
Finding the maximum clique in massive graphs
inferred← citeshttps://doi.org/10.15607/rss.2014.x.006openalex-snapshot
Hierarchical Semantic Labeling for Task-Relevant RGB-D Perception
inferred← citeshttps://doi.org/10.1587/transfun.2024eal2106openalex-snapshot
Autonomous Agile Earth Observation Satellite Mission Planning with Task Clustering
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012314openalex-snapshot
Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems
inferred← citeshttps://doi.org/10.18653/v1/2020.acl-main.318openalex-snapshot
A Graph-based Coarse-to-fine Method for Unsupervised Bilingual Lexicon Induction
inferred← citeshttps://doi.org/10.18653/v1/2021.trustnlp-1openalex-snapshot
Proceedings of the First Workshop on Trustworthy Natural Language Processing
inferred← citeshttps://doi.org/10.18653/v1/2021.trustnlp-1.5openalex-snapshot
xER: An Explainable Model for Entity Resolution using an Efficient Solution for the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4720openalex-snapshot
ECONOMIC APPROACHES AND MARKET STRUCTURES FOR TEMPORAL-SPATIAL SPECTRUM SHARING
inferred← citeshttps://doi.org/10.3390/a5040545openalex-snapshot
Exact Algorithms for Maximum Clique: A Computational Study
inferred← citeshttps://doi.org/10.3390/ani15070996openalex-snapshot
Revealing the Hidden Social Structure of Pigs with AI-Assisted Automated Monitoring Data and Social Network Analysis
inferred← citeshttps://doi.org/10.3390/math14183352openalex-snapshot
Maximal Cliques as a Normal Form in the Algebra of Graphs: Compression by Modular Decomposition and an Enumeration Algorithm
inferred← citeshttps://doi.org/10.4230/dagsemproc.10441.2openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
inferred← citeshttps://doi.org/10.4230/lipics.esa.2023.31openalex-snapshot
Designing Output Sensitive Algorithms for Subgraph Enumeration
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5229openalex-snapshot
Distributed Algorithms for Optimal Power Flow Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1209.4560openalex-snapshot
Distributing an Exact Algorithm for Maximum Clique: maximising the costup
inferred← citeshttps://doi.org/10.48550/arxiv.1507.03067openalex-snapshot
Micro-Clustering: Finding Small Clusters in Large Diversity
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03659openalex-snapshot
Listing Maximal Subgraphs in Strongly Accessible Set Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2009.10376openalex-snapshot
Efficiently Finding a Maximal Clique Summary via Effective Sampling
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0410039openalex-snapshot
Generating All Maximal Induced Subgraphs for Hereditary, Connected-Hereditary and Rooted-Hereditary Properties
inferred← citeshttps://doi.org/10.5441/002/edbt.2018.07openalex-snapshot
Finding All Maximal Connected s-Cliques in Social Networks
inferred← citeshttps://doi.org/10.70675/52cc84b4z45c7z4edez8dcbz73e425a27252openalex-snapshot
Mining useful patterns in attributed graphs
inferred← citeshttps://doi.org/10.70675/84699c18zaa68z4376zb424z638b16aafc39openalex-snapshot
Discovering and exploiting analogical proportions in a relational database context
inferred← citeshttps://doi.org/10.70675/bb653a90z1ddaz4d00z8885z5df4b3f1a6ebopenalex-snapshot
On the dualization problem in graphs, hypergraphs, and lattices
inferred← citeshttps://doi.org/10.7298/x4w66hq9openalex-snapshot
Unsupervised Structured Learning Of Human Activities For Robot Perception
inferred← citeshttps://doi.org/10.7717/peerj-cs.2501openalex-snapshot
k-Clique counting on large scale-graphs: a survey
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.