Optimal algorithms for sensitivity analysis in associative multiplication problems
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 14 (1) , 79-90
- https://doi.org/10.1016/0304-3975(81)90006-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A new shortest path updating algorithmNetworks, 1978
- Self-Organizing Binary Search TreesJournal of the ACM, 1978
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear ProgrammingManagement Science, 1977
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975
- Order- n correction for regular languagesCommunications of the ACM, 1974