An On-Line Edge-Deletion Problem

Cited in

(58)

On-line computation of transitive closures of graphs
Dynamic cycle detection
Amortized efficiency of a path retrieval data structure
A topological approach to dynamic graph connectivity
Finding paths and deleting edges in directed acyclic graphs
A special case the of dynamization problem for least cost paths
On-line computation of minimal and maximal length paths
Maintaining bridge-connected and biconnected components on-line
On the computational complexity of dynamic graph problems
Semi-dynamic breadth-first search in digraphs
Decremental 2- and 3-connectivity on planar graphs
Single-source shortest paths and strong connectivity in dynamic planar graphs
Constructing light spanners deterministically in near-linear time
Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
Building Cartesian trees from free trees with \(k\) leaves
An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
Randomization for efficient dynamic graph algorithms (invited talk)
Maintaining shortest paths under deletions in weighted directed graphs
Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
Algorithmic techniques for maintaining shortest routes in dynamic networks
Optimal on-line decremental connectivity in trees
Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
Dynamic single-source shortest paths in Erdős-Rényi random graphs
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
Maintaining minimum spanning trees in dynamic graphs
Decremental strongly connected components and single-source reachability in near-linear time
Semi-dynamic shortest paths and breadth-first search in digraphs
Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
Dynamic 2- and 3-connectivity on planar graphs
Constructing Light Spanners Deterministically in Near-Linear Time
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
Least resolved trees for two-colored best match graphs
scientific article; zbMATH DE number 7559464 (Why is no real title available?)
Algorithms and hardness for diameter in dynamic graphs
Fault tolerant and fully dynamic DFS in undirected graphs: simple yet efficient
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
On Cartesian trees and range minimum queries
An \(O(n^2)\) time algorithm for alternating Büchi games
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
A fully dynamic algorithm for maintaining the transitive closure
On dynamic shortest paths problems
A new deterministic algorithm for fully dynamic all-pairs shortest paths
Deterministic incremental APSP with polylogarithmic update time and stretch
Fully dynamic sequential and distributed algorithms for MAX-CUT
New tradeoffs for decremental approximate all-pairs shortest paths
On the complexity of algorithms with predictions for dynamic graph problems
Average sensitivity of the knapsack problem
Decremental APSP in unweighted digraphs versus an adaptive adversary
Fast compatibility testing for rooted phylogenetic trees
On incremental approximate shortest paths in directed graphs
Incremental approximate single-source shortest paths with predictions
Lifelong planning \(\text{A}^*\)
Incomplete directed perfect phylogeny in linear time
Fast dynamic transitive closure with lookahead
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
Dynamic maintenance of directed hypergraphs
Mantaining dynamic matrices for fully dynamic transitive closure

This page was built for publication: An On-Line Edge-Deletion Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902517)