On the public citation graph

Hypergraph traversal revisited: Cost measures and dynamic algorithms

https://doi.org/10.1007/bfb0055754
0 signed · 32 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.1006/jagm.1996.0046openalex-snapshot
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
inferredcites →https://doi.org/10.1007/bfb0023812openalex-snapshot
Linear time algorithms for liveness and boundedness in conflict-free Petri nets
inferredcites →https://doi.org/10.1007/bfb0083470openalex-snapshot
Hyperpaths and shortest hyperpaths
inferredcites →https://doi.org/10.1016/0020-0190(77)90002-3openalex-snapshot
A generalization of Dijkstra's algorithm
inferredcites →https://doi.org/10.1016/0166-218x(93)90045-popenalex-snapshot
Directed hypergraphs and applications
inferredcites →https://doi.org/10.1016/0304-3975(90)90030-lopenalex-snapshot
Dynamic maintenance of directed hypergraphs
inferredcites →https://doi.org/10.1016/0743-1066(91)90006-bopenalex-snapshot
On-line algorithms for polynomially solvable satisfiability problems
inferredcites →https://doi.org/10.1016/s0304-3975(96)00123-5openalex-snapshot
On-line algorithms for satisfiability problems with uncertainty
inferredcites →https://doi.org/10.1137/0215029openalex-snapshot
Minimal Representation of Directed Hypergraphs
inferredcites →https://doi.org/10.1145/2157.322404openalex-snapshot
Graph Algorithms for Functional Dependency Manipulation
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.7146/dpb.v21i380.6612openalex-snapshot
On-Line Reevaluation of Functions
inferredcites →https://doi.org/10.7916/d8f196t2openalex-snapshot
Online Maintenance of Minimal Directed Hypergraphs

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.4178917openalex-extracted
Finding (S,D)-Hypernetworks in F-Hypergraphs is Np-Hard
inferred← citeshttps://doi.org/10.1002/sam.10027openalex-snapshot
Association Rules Network: Definition and Applications
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_20openalex-snapshot
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-45332-8_6openalex-snapshot
Structure-Guided Solution of Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-319-13296-9_3openalex-snapshot
The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_40openalex-snapshot
Complexity of Linear Connectivity Problems in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-75271-4_15openalex-snapshot
Heuristics for Planning with Action Costs
inferred← citeshttps://doi.org/10.1007/s13740-018-0099-xopenalex-snapshot
Ant-Colony Optimisation for Path Recommendation in Business Process Execution
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.09.006openalex-snapshot
Shortest path algorithms for functional environments
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.06.011openalex-snapshot
Finding the K best policies in a finite-horizon Markov decision process
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.036openalex-snapshot
Optimized cross-organizational business process monitoring: Design and enactment
inferred← citeshttps://doi.org/10.1016/j.ins.2018.08.058openalex-snapshot
Optimal directed hypergraph traversal with ant-colony optimisation
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.005openalex-snapshot
Partially dynamic maintenance of minimum weight hyperpaths
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.038openalex-snapshot
Linear connectivity problems in directed hypergraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.016openalex-snapshot
Directed hypergraphs: Introduction and fundamental algorithms—A survey
inferred← citeshttps://doi.org/10.1109/icde.2004.1320063openalex-snapshot
On local pruning of association rules using directed hypergraphs
inferred← citeshttps://doi.org/10.1109/rndm64105.2024.10820429openalex-snapshot
Higher-Order Graph Models in Network Security
inferred← citeshttps://doi.org/10.1145/3332466.3374527openalex-snapshot
Practical parallel hypergraph algorithms
inferred← citeshttps://doi.org/10.12677/aam.2023.122056openalex-snapshot
Design of Min-Max Disjoint Backward Hy-perpaths Algorithm in Acyclic Backward Hypergraph
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.