Dynamic data structures for series parallel digraphs
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 352-372
- https://doi.org/10.1007/3-540-51542-9_30
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- INC: a language for incremental computationsACM SIGPLAN Notices, 1988
- Finding paths and deleting edges in directed acyclic graphsInformation Processing Letters, 1988
- A topological approach to dynamic graph connectivityInformation Processing Letters, 1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- A linear algorithm for the domination number of a series-parallel graphDiscrete Applied Mathematics, 1983
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932