On the public citation graph

Finding Small Complete Subgraphs Efficiently

https://doi.org/10.2139/ssrn.4729167
0 signed · 28 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/11427186_54openalex-extracted
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
inferredcites →https://doi.org/10.1007/978-3-319-21840-3_39openalex-extracted
Dynamic Set Intersection
inferredcites →https://doi.org/10.1007/bf02523189openalex-extracted
Finding and counting given length cycles
inferredcites →https://doi.org/10.1016/0020-0190(81)90041-7openalex-extracted
The clique problem for planar graphs
inferredcites →https://doi.org/10.1016/0020-0190(94)90121-xopenalex-extracted
Arboricity and bipartite subgraph listing algorithms
inferredcites →https://doi.org/10.1016/j.dam.2007.03.023openalex-extracted
Open problems around exact algorithms
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.009openalex-extracted
On the complexity of fixed parameter clique and dominating set
inferredcites →https://doi.org/10.1016/s0020-0190(00)00047-8openalex-extracted
Finding and counting small induced subgraphs efficiently
inferredcites →https://doi.org/10.1016/s0196-8858(02)00037-4openalex-extracted
Counting cycles and finite dimensional L norms
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-extracted
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1080/15427951.2012.625260openalex-extracted
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
inferredcites →https://doi.org/10.1090/stml/053openalex-extracted
Thirty-three Miniatures
inferredcites →https://doi.org/10.1109/focs57990.2023.00130openalex-extracted
Faster Matrix Multiplication via Asymmetric Hashing
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-extracted
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.12openalex-extracted
Decomposition of Finite Graphs Into Forests
inferredcites →https://doi.org/10.1137/0214017openalex-extracted
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1137/1.9781611973198.1openalex-extracted
Triangle Listing Algorithms: Back from the Diversion
inferredcites →https://doi.org/10.1137/1.9781611977912.134openalex-extracted
New Bounds for Matrix Multiplication: from Alpha to Omega
inferredcites →https://doi.org/10.1137/15m1054389openalex-extracted
Approximately Counting Triangles in Sublinear Time
inferredcites →https://doi.org/10.1142/9789812777638_0012openalex-extracted
Edge-Coloring and f-Coloring for Various Classes of Graphs
inferredcites →https://doi.org/10.1145/3034786.3056115openalex-extracted
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection
inferredcites →https://doi.org/10.1145/3186893openalex-extracted
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
inferredcites →https://doi.org/10.1145/800070.802205openalex-extracted
On approximating a vertex cover for planar graphs
inferredcites →https://doi.org/10.1145/800105.803390openalex-extracted
Finding a minimum circuit in a graph
inferredcites →https://doi.org/10.3390/a15120448openalex-extracted
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
inferredcites →https://doi.org/10.3390/a7020243openalex-extracted
Efficient Algorithms for Subgraph Listing
inferredcites →https://doi.org/10.4230/lipics.isaac.2017.39openalex-extracted
Dominance Product and High-Dimensional Closest Pair under L_infty
inferredcites →https://doi.org/10.46298/theoretics.24.21openalex-extracted
A Refined Laser Method and Faster Matrix Multiplication
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.