On the public citation graph

Efficient Algorithms for Subgraph Listing

https://doi.org/10.3390/a7020243

0 signed · 13 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-snapshot

Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study

inferredcites →https://doi.org/10.1007/978-3-642-40104-6_27openalex-snapshot

A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs

inferredcites →https://doi.org/10.1007/s10618-005-0003-9openalex-snapshot

Finding Frequent Patterns in a Large Sparse Graph*

inferredcites →https://doi.org/10.1016/j.ipl.2008.10.012openalex-snapshot

Faster multi-witnesses for Boolean matrix multiplication

inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1109/focs.2012.80openalex-snapshot

Faster Algorithms for Rectangular Matrix Multiplication

inferredcites →https://doi.org/10.1137/0207033openalex-snapshot

Finding a Minimum Circuit in a Graph

inferredcites →https://doi.org/10.1137/0214017openalex-snapshot

Arboricity and Subgraph Listing Algorithms

inferredcites →https://doi.org/10.1145/2213977.2214056openalex-snapshot

Multiplying matrices faster than coppersmith-winograd

inferredcites →https://doi.org/10.2307/2583667openalex-snapshot

Introduction to Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4729167openalex-extracted

Finding Small Complete Subgraphs Efficiently

inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_16openalex-snapshot

Finding Small Complete Subgraphs Efficiently

inferred← citeshttps://doi.org/10.1145/3639284openalex-snapshot

HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs

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.