The following pages link to An On-Line Edge-Deletion Problem (Q3902517):
Displayed 49 items.
- Optimal on-line decremental connectivity in trees (Q290266) (← links)
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights (Q528469) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- Lifelong planning \(\text{A}^*\) (Q814587) (← links)
- Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- Dynamic cycle detection (Q1055194) (← links)
- Amortized efficiency of a path retrieval data structure (Q1099629) (← links)
- A topological approach to dynamic graph connectivity (Q1108030) (← links)
- Finding paths and deleting edges in directed acyclic graphs (Q1115184) (← links)
- A special case the of dynamization problem for least cost paths (Q1183415) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
- On the computational complexity of dynamic graph problems (Q1351463) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
- Building Cartesian trees from free trees with \(k\) leaves (Q2450934) (← links)
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps (Q2505621) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs (Q2805514) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830) (← links)
- Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs (Q3467869) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Maintaining minimum spanning trees in dynamic graphs (Q4571989) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning (Q5054804) (← links)
- Dynamic 2- and 3-connectivity on planar graphs (Q5056143) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- Least resolved trees for two-colored best match graphs (Q5084685) (← links)
- (Q5089272) (← links)
- (Q5091161) (← links)
- (Q5092428) (← links)
- (Q5743484) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)