STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fully dynamic planarity testing (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Dynamic parallel tree contraction (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth 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
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An empirical study of dynamic graph algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Clustering for faster network simplex pivots
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Dynamic two-connectivity with backtracking
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
An O (n log n) algorithm for maximum st-flow in a directed planar graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
K*: A heuristic search algorithm for finding the k shortest paths
Artificial Intelligence
| Hi-index | 0.00 |
Ambivalent data structures are presented for several problems on undirected graphs. They are used in finding the k smallest spanning trees of a weighted undirected graph in O(m log beta (m,n)+min(k/sup 3/2/, km/sup 1/2/)) time, where m is the number of edges and n the number of vertices in the graph. The techniques are extended to find the k smallest spanning trees in an embedded planar graph in O(n+k(log n)/sup 3/) time. Ambivalent data structures are also used to maintain dynamically 2-edge-connectivity information. Edges and vertices can be inserted or deleted in O(m/sup 1/2/) time, and a query as to whether two vertices are in the same 2-edge-connected component can be answered in O(log n) time, where m and n are understood to be the current number of edges and vertices, respectively. Again, the techniques are extended to maintain an embedded planar graph so that edges and vertices can be inserted or deleted in O((log n)/sup 3/) time, and a query answered in O(log n) time.