On-line computation of minimal and maximal length paths
Authors:
- Giorgio AusielloGAGiorgio Ausiello
- Giuseppe F. ItalianoGIGiuseppe F. Italiano
- Umberto NanniUNUmberto Nanni
- 1 March 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 95 (2) , 245-261
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Chordality properties on graphs and minimal conceptual connections in semantic data modelsJournal of Computer and System Sciences, 1986
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- On-line computation of transitive closures of graphsInformation Processing Letters, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979