Partially dynamic maintenance of minimum weight hyperpaths

DOI10.1016/J.JDA.2003.12.005MaRDI QIDQ1775013zbMATH OpenOpenAlexFDO

Authors Giorgio Ausiello, Paolo G. Franciosa, Daniele Frigioni

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

zbMATH Keywords

dynamic algorithmdirected hypergraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• Minimum cost paths over dynamic networks
• scientific article; zbMATH DE number 7204496
• Path minima queries in dynamic weighted trees
• Dynamic maintenance of directed hypergraphs
• Partially dynamic single-source shortest paths on digraphs with positive weights
• Maintaining minimum spanning trees in dynamic graphs
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Semidynamic algorithms for maintaining single-source shortest path trees
• On dynamic shortest paths problems
• Algorithms – ESA 2004

Cites work

• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 4112412 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 1222555 (Why is no real title available?)
• scientific article; zbMATH DE number 1531965 (Why is no real title available?)
• A directed hypergraph model for random time dependent shortest paths
• A generalization of Dijkstra's algorithm
• A linear time algorithm for unique Horn satisfiability
• A unified approach for deciding the existence of certain petri net paths
• Amortized Computational Complexity
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Connections in acyclic hypergraphs
• Directed hypergraphs and applications
• Directed recursive labelnode hypergraphs: A new representation-language
• Dynamic Programming as Graph Searching: An Algebraic Approach
• Dynamic maintenance of directed hypergraphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Forward chaining is simple\((x)\)
• Graph Algorithms for Functional Dependency Manipulation
• Max Horn SAT and the minimum cut problem in directed hypergraphs
• Minimal Representation of Directed Hypergraphs
• Model checking and boolean graphs
• On-line algorithms for polynomially solvable satisfiability problems
• On-line algorithms for satisfiability problems with uncertainty

Cited in

(6)

• Dynamic maintenance of directed hypergraphs
• scientific article; zbMATH DE number 2044509 (Why is no real title available?)
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Linear time analysis of properties of conflict-free and general Petri nets
• Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard
• Linear connectivity problems in directed hypergraphs

This page was built for publication: Partially dynamic maintenance of minimum weight hyperpaths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775013)