On the public citation graph

Finding (S,D)-Hypernetworks in F-Hypergraphs is Np-Hard

https://doi.org/10.2139/ssrn.4178917
0 signed · 9 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-45446-2_20openalex-extracted
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
inferredcites →https://doi.org/10.1007/bfb0055754openalex-extracted
Hypergraph traversal revisited: Cost measures and dynamic algorithms
inferredcites →https://doi.org/10.1016/j.ejor.2007.04.023openalex-extracted
Hypernetworks in a directed hypergraph
inferredcites →https://doi.org/10.1016/j.ejor.2013.04.020openalex-extracted
Finding hypernetworks in directed hypergraphs
inferredcites →https://doi.org/10.1016/j.jda.2003.12.005openalex-extracted
Partially dynamic maintenance of minimum weight hyperpaths
inferredcites →https://doi.org/10.1016/j.tcs.2009.02.038openalex-extracted
Linear connectivity problems in directed hypergraphs
inferredcites →https://doi.org/10.1016/j.tcs.2016.03.016openalex-extracted
Directed hypergraphs: Introduction and fundamental algorithms—A survey
inferredcites →https://doi.org/10.1145/800157.805047openalex-extracted
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1016/0166-218x(93)90045-popenalex-snapshot
Directed hypergraphs and applications
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.