A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reinventing the wheel: an optimal data structure for connectivity queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms (TALG)
Finding 3-shredders efficiently
ACM Transactions on Algorithms (TALG)
Bisecting a 4-connected graph with three resource sets
Discrete Applied Mathematics
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Given a graph G with n vertices and m edges, a k-connectivity query for vertices v' and v" of G asks whether there exist k disjoint paths between v' and v". The authors consider the problem of performing k-connectivity queries for k