Partially dynamic maintenance of minimum weight hyperpaths
From MaRDI portal
Publication:1775013
DOI10.1016/j.jda.2003.12.005zbMath1062.05104OpenAlexW1998999822MaRDI QIDQ1775013
Giorgio Ausiello, Daniele Frigioni, Paolo Giulio Franciosa
Publication date: 4 May 2005
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2003.12.005
Applications of graph theory (05C90) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Linear time analysis of properties of conflict-free and general Petri nets ⋮ Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Linear connectivity problems in directed hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line algorithms for satisfiability problems with uncertainty
- Connections in acyclic hypergraphs
- Dynamic maintenance of directed hypergraphs
- A unified approach for deciding the existence of certain petri net paths
- Directed recursive labelnode hypergraphs: A new representation-language
- A generalization of Dijkstra's algorithm
- A linear time algorithm for unique Horn satisfiability
- Model checking and boolean graphs
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- A directed hypergraph model for random time dependent shortest paths
- Directed hypergraphs and applications
- Forward chaining is simple\((x)\)
- Graph Algorithms for Functional Dependency Manipulation
- Amortized Computational Complexity
- Minimal Representation of Directed Hypergraphs
- Dynamic Programming as Graph Searching: An Algebraic Approach
- On-line algorithms for polynomially solvable satisfiability problems
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: Partially dynamic maintenance of minimum weight hyperpaths
