On the public citation graph

A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns

0 signed · 62 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.1007/3-540-44957-4_65openalex-snapshot
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
inferredcites →https://doi.org/10.1007/3-540-49257-7_1openalex-snapshot
Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java™
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-27810-8_23openalex-snapshot
New Algorithms for Enumerating All Maximal Cliques
inferredcites →https://doi.org/10.1007/b98413openalex-snapshot
Algorithm Theory - SWAT 2004
inferredcites →https://doi.org/10.1016/0020-0190(94)90121-xopenalex-snapshot
Arboricity and bipartite subgraph listing algorithms
inferredcites →https://doi.org/10.1016/s1389-1286(00)00083-9openalex-snapshot
Graph structure in the Web
inferredcites →https://doi.org/10.1016/s1389-1286(99)00040-7openalex-snapshot
Trawling the Web for emerging cyber-communities
inferredcites →https://doi.org/10.1093/bioinformatics/bth922openalex-snapshot
Predicting protein–peptide interactions via a network-based motif sampler
inferredcites →https://doi.org/10.1109/wi.2004.10154openalex-snapshot
Discovery of User Communities from Web Audience Measurement Data
inferredcites →https://doi.org/10.1109/wi.2004.56openalex-snapshot
Discovery of User Communities from Web Audience Measurement Data
inferredcites →https://doi.org/10.1126/science.1064987openalex-snapshot
A Combined Experimental and Computational Strategy to Define Protein Interaction Networks for Peptide Recognition Modules
inferredcites →https://doi.org/10.1126/science.1065103openalex-snapshot
Specificity and Stability in Topology of Protein Networks
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/1133905.1133916openalex-snapshot
LCM ver.3
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/1807167openalex-snapshot
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
inferredcites →https://doi.org/10.1145/956750.956779openalex-snapshot
CLOSET+
inferredcites →https://doi.org/10.1145/956750.956832openalex-snapshot
Carpenter
inferredcites →https://doi.org/10.1145/959242.959249openalex-snapshot
State of the art of graph-based data mining
inferredcites →https://doi.org/10.1186/gb-2003-4-3-r23openalex-snapshot
The GRID: The General Repository for Interaction Datasets
inferredcites →https://doi.org/10.5860/choice.42-2854bopenalex-snapshot
Handbook of graph theory

What points at this work

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

inferred← citeshttps://doi.org/10.1002/sam.10051openalex-snapshot
Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks
inferred← citeshttps://doi.org/10.1007/11823728_42openalex-snapshot
Efficient Mining of Large Maximal Bicliques
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-319-31204-0_10openalex-snapshot
Bicliques in Graphs with Correlated Edges: From Artificial to Biological Networks
inferred← citeshttps://doi.org/10.1007/978-981-10-7635-0_23openalex-snapshot
Top-k Category Search for an IP Address-Product Network
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/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/s12528-021-09292-0openalex-snapshot
A framework to capture the dependency between prerequisite and advanced courses in higher education
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.1063/1.5094272openalex-snapshot
A biclustering procedure using BicBin algorithm for HIV-1 human protein interaction database in NCBI
inferred← citeshttps://doi.org/10.1089/omi.2018.0205openalex-snapshot
Biomolecular Databases and Subnetwork Identification Approaches of Interest to Big Data Community: An Expert Review
inferred← citeshttps://doi.org/10.1093/bioinformatics/btl020openalex-snapshot
Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale
inferred← citeshttps://doi.org/10.1093/nar/gku102openalex-snapshot
Constructing module maps for integrated analysis of heterogeneous biological networks
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/icde53745.2022.00187openalex-snapshot
Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00086openalex-snapshot
Maximal Similar-Weight Biclique Enumeration for Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icdm.2006.27openalex-snapshot
Biclustering Protein Complex Interactions with a Biclique Finding Algorithm
inferred← citeshttps://doi.org/10.1109/icoac.2017.8441514openalex-snapshot
Top-K Similar Access Behavior Based On Structural Equivalence
inferred← citeshttps://doi.org/10.1109/pacificvis.2017.8031597openalex-snapshot
Quasi-biclique edge concentration: A visual analytics method for biclustering
inferred← citeshttps://doi.org/10.1109/tkde.2012.37openalex-snapshot
Centroid-Based Actionable 3D Subspace Clustering
inferred← citeshttps://doi.org/10.1109/tkde.2022.3220901openalex-snapshot
Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2023.3272110openalex-snapshot
Efficient Maximal Biclique Enumeration on Large Uncertain Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2023.3296721openalex-snapshot
Efficient Balanced Signed Biclique Search in Signed Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2024.3373654openalex-snapshot
Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs
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.1137/1.9781611972788.7openalex-snapshot
Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications
inferred← citeshttps://doi.org/10.1145/1639714.1639787openalex-snapshot
Recommender systems for the conference paper assignment problem
inferred← citeshttps://doi.org/10.1145/2808719.2812595openalex-snapshot
Scalable multipartite subgraph enumeration for integrative analysis of heterogeneous experimental functional genomics data
inferred← citeshttps://doi.org/10.1145/2902251.2902278openalex-snapshot
Space Lower Bounds for Itemset Frequency Sketches
inferred← citeshttps://doi.org/10.1145/3460620.3460735openalex-snapshot
An Effective Algorithm for Extracting Maximal Bipartite Cliques
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.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.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.3390/a12010023openalex-snapshot
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1707.08272openalex-snapshot
A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph
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.