Hypergraph traversal revisited: Cost measures and dynamic algorithms
- 1 January 1998
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Linear time algorithms for liveness and boundedness in conflict-free Petri netsPublished by Springer Science and Business Media LLC ,2005
- On-line algorithms for satisfiability problems with uncertaintyTheoretical Computer Science, 1997
- Directed hypergraphs and applicationsDiscrete Applied Mathematics, 1993
- On-line algorithms for polynomially solvable satisfiability problemsThe Journal of Logic Programming, 1991
- Dynamic maintenance of directed hypergraphsTheoretical Computer Science, 1990
- Hyperpaths and shortest hyperpathsLecture Notes in Mathematics, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Minimal Representation of Directed HypergraphsSIAM Journal on Computing, 1986
- Graph Algorithms for Functional Dependency ManipulationJournal of the ACM, 1983
- A generalization of Dijkstra's algorithmInformation Processing Letters, 1977