On the public citation graph
Efficient Mining of Large Maximal Bicliques
0 signed · 83 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.1007/11564126_18openalex-snapshot
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
inferredcites →https://doi.org/10.1007/3-540-49257-7_25openalex-snapshot
Discovering Frequent Closed Itemsets for Association Rules
inferredcites →https://doi.org/10.1007/978-3-540-24775-3_73openalex-snapshot
Constraint-Based Mining of Formal Concepts in Transactional Data
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_19openalex-snapshot
The Worst-Case Time Complexity for Generating All Maximal Cliques
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.1016/0012-365x(80)90109-0openalex-snapshot
On the coverings of graphs
inferredcites →https://doi.org/10.1016/0020-0190(94)90121-xopenalex-snapshot
Arboricity and bipartite subgraph listing algorithms
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/s1389-1286(99)00040-7openalex-snapshot
Trawling the Web for emerging cyber-communities
inferredcites →https://doi.org/10.1023/b:mach.0000033117.77257.41openalex-snapshot
A New Conceptual Clustering Framework
inferredcites →https://doi.org/10.1093/molbev/msg115openalex-snapshot
Obtaining Maximal Concatenated Phylogenetic Data Sets from Large Sequence Databases
inferredcites →https://doi.org/10.1093/nar/gkg340openalex-snapshot
Topological structure analysis of the protein-protein interaction network in budding yeast
inferredcites →https://doi.org/10.1137/1.9781611972726.27openalex-snapshot
CHARM: An Efficient Algorithm for Closed Itemset Mining
inferredcites →https://doi.org/10.1145/1007730.1007744openalex-snapshot
Advances in frequent itemset mining implementations
inferredcites →https://doi.org/10.1145/170035.170072openalex-snapshot
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.1145/956750.956827openalex-snapshot
On computing, storing and querying frequent patterns
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22775openalex-snapshot
On the edge‐biclique graph and the iterated edge‐biclique operator
inferred← citeshttps://doi.org/10.1002/sam.10089openalex-snapshot
A novel framework for detecting maximally banded matrices in binary data
inferred← citeshttps://doi.org/10.1007/978-3-030-05755-8_21openalex-snapshot
An Optimized MBE Algorithm on Sparse Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-97568-5_3openalex-snapshot
CSS on Bipartite Networks
inferred← citeshttps://doi.org/10.1007/s00778-021-00681-6openalex-snapshot
Maximum and top-k diversified biclique search at scale
inferred← citeshttps://doi.org/10.1007/s00778-023-00834-9openalex-snapshot
Identifying similar-bicliques in bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-024-00882-9openalex-snapshot
Accelerating maximum biplex search over large bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00939-3openalex-snapshot
Efficient maximum signed biclique and biplex identification in signed bipartite graphs
inferred← citeshttps://doi.org/10.1007/s10618-012-0258-xopenalex-snapshot
A survey on enhanced subspace clustering
inferred← citeshttps://doi.org/10.1007/s10619-026-07463-5openalex-snapshot
Personalized maximum $$(\alpha ,\beta ,\eta )$$-biclique search On uncertain bipartite graph
inferred← citeshttps://doi.org/10.1007/s10898-013-0053-2openalex-snapshot
A continuous characterization of the maximum-edge biclique problem
inferred← citeshttps://doi.org/10.1007/s11280-021-00914-2openalex-snapshot
Efficient critical relationships identification in bipartite networks
inferred← citeshttps://doi.org/10.1007/s11280-021-00927-xopenalex-snapshot
Efficient maintenance for maximal bicliques in bipartite graph streams
inferred← citeshttps://doi.org/10.1007/s12528-021-09292-0openalex-snapshot
A framework to capture the dependency between prerequisite and advanced courses in higher education
inferred← citeshttps://doi.org/10.1007/s13278-021-00791-7openalex-snapshot
Theoretical and computational characterizations of interaction mechanisms on Facebook dynamics using a common knowledge model
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.022openalex-snapshot
Almost every graph is divergent under the biclique operator
inferred← citeshttps://doi.org/10.1016/j.dam.2020.02.010openalex-snapshot
Biclique graphs of interval bigraphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100657openalex-snapshot
The Bipartite Boolean Quadric Polytope
inferred← citeshttps://doi.org/10.1016/j.ins.2010.08.035openalex-snapshot
A case study on financial ratios via cross-graph quasi-bicliques
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.029openalex-snapshot
Biclique Graphs of K3-free Graphs and Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622352openalex-snapshot
Enumerating Top-k Quasi-Cliques
inferred← citeshttps://doi.org/10.1109/bigdata.congress.2014.105openalex-snapshot
Enumerating Maximal Bicliques from a Large Graph Using MapReduce
inferred← citeshttps://doi.org/10.1109/cse.2018.00025openalex-snapshot
Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming
inferred← citeshttps://doi.org/10.1109/fskd.2012.6233927openalex-snapshot
Mining frequent maximal cliques efficiently by global view graph
inferred← citeshttps://doi.org/10.1109/hipc.2019.00016openalex-snapshot
Shared-Memory Parallel Maximal Biclique Enumeration
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00042openalex-snapshot
Efficient Personalized Maximum Biclique Search
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00105openalex-snapshot
Efficient Maximum Signed Biclique Identification
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00200openalex-snapshot
Maximal Biclique Enumeration: A Prefix Tree Based Approach
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00405openalex-snapshot
Bipartite Graph Analytics: Current Techniques and Future Trends
inferred← citeshttps://doi.org/10.1109/icdm.2006.111openalex-snapshot
Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment
inferred← citeshttps://doi.org/10.1109/sc41406.2024.00106openalex-snapshot
Enumeration of Billions of Maximal Bicliques in Bipartite Graphs without Using GPUs
inferred← citeshttps://doi.org/10.1109/tc.2024.3441864openalex-snapshot
AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing
inferred← citeshttps://doi.org/10.1109/tc.2025.3566898openalex-snapshot
Advanced Maximal Biclique Enumeration on GPUs Using Bitmaps
inferred← citeshttps://doi.org/10.1109/tmscs.2018.2802920openalex-snapshot
Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
inferred← citeshttps://doi.org/10.1109/tsc.2016.2523997openalex-snapshot
Enumerating Maximal Bicliques from a Large Graph Using MapReduce
inferred← citeshttps://doi.org/10.1137/1.9781611972795.18openalex-snapshot
Discovering Substantial Distinctions among Incremental Bi-Clusters
inferred← citeshttps://doi.org/10.1137/1.9781611972801.82openalex-snapshot
Mining Maximally Banded Matrices in Binary Data
inferred← citeshttps://doi.org/10.1145/1458082.1458228openalex-snapshot
An effective algorithm for mining 3-clusters in vertically partitioned data
inferred← citeshttps://doi.org/10.1145/3448016.3457538openalex-snapshot
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions
inferred← citeshttps://doi.org/10.1145/3460620.3460735openalex-snapshot
An Effective Algorithm for Extracting Maximal Bipartite Cliques
inferred← citeshttps://doi.org/10.1145/3488560.3498390openalex-snapshot
Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3581784.3607059openalex-snapshot
Efficient Maximal Biclique Enumeration on GPUs
inferred← citeshttps://doi.org/10.1145/3589283openalex-snapshot
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches
inferred← citeshttps://doi.org/10.1145/3654938openalex-snapshot
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee
inferred← citeshttps://doi.org/10.1145/3709666openalex-snapshot
BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs
inferred← citeshttps://doi.org/10.1145/3709680openalex-snapshot
Density Decomposition of Bipartite Graphs
inferred← citeshttps://doi.org/10.1186/1471-2105-15-110openalex-snapshot
On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0110356openalex-snapshot
Efficient Mining of Maximal Bicliques in Graph by Pruning Search Space
inferred← citeshttps://doi.org/10.14778/3397230.3397234openalex-snapshot
Maximum biclique search at billion scale
inferred← citeshttps://doi.org/10.14778/3551793.3551854openalex-snapshot
Identifying similar-bicliques in bipartite graphs
inferred← citeshttps://doi.org/10.14778/3681954.3681997openalex-snapshot
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
inferred← citeshttps://doi.org/10.14778/3836663.3836687openalex-snapshot
Maximum Defective Biclique Search in Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v35i17.17781openalex-snapshot
Using Unsupervised Learning for Data-driven Procurement Demand Aggregation
inferred← citeshttps://doi.org/10.3233/jifs-18263openalex-snapshot
A top down approach to enumerate α -maximal cliques in uncertain graphs
inferred← citeshttps://doi.org/10.3390/a10040113openalex-snapshot
Scale Reduction Techniques for Computing Maximum Induced Bicliques
inferred← citeshttps://doi.org/10.3390/math13010088openalex-snapshot
Maximum Butterfly Generators Search in Bipartite Networks
inferred← citeshttps://doi.org/10.46244/numeracy.v1i2.126openalex-snapshot
Menentukan Subgraf Biclique Maksimal dengan Pasangan Pola Tertutup dari Matriks Adjacency
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09686openalex-snapshot
Structural properties of biclique graphs and the distance formula
inferred← citeshttps://doi.org/10.5555/2615731.2615774openalex-snapshot
Collective action through common knowledge using a facebook 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.