Data structures and network algorithms
Data structures and network algorithms
A dynamization of the all pairs least cost path problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A topological approach to dynamic graph connectivity
Information Processing Letters
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Finding paths and deleting edges in directed acyclic graphs
Information Processing Letters
INC: a language for incremental computations
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Maintenance of transitive closures and transitive reductions of graphs
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
A data structure for dynamic trees
Journal of Computer and System Sciences
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Incremental data flow analysis via dominator and attribute update
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Dynamic Maintenance of Paths and Path Expressions on Graphs
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Incremental computation of shortest paths in semi-dynamic graphs using software components
Proceedings of the 44th annual Southeast regional conference
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Dynamically maintaining split graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |