Pages that link to "Item:Q3694711"
From MaRDI portal
The following pages link to Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications (Q3694711):
Displaying 50 items.
- Optimal on-line decremental connectivity in trees (Q290266) (← links)
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- A note on set union with arbitrary deunions (Q751279) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- Finding paths and deleting edges in directed acyclic graphs (Q1115184) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Static and dynamic parallel computation of connected components (Q1322111) (← links)
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
- Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Fully dynamic biconnectivity in graphs (Q1892579) (← links)
- Scheduling tree dags on parallel architectures (Q1911467) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
- An efficient algorithm for batch stability testing (Q1959725) (← links)
- Fourier decompositions of graphs with symmetries and equitable partitions (Q2041776) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions (Q2507694) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Incremental Network Design with Minimum Spanning Trees (Q2971398) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- (Q4488857) (← links)
- Minimizing diameters of dynamic trees (Q4571959) (← links)
- Maintaining minimum spanning trees in dynamic graphs (Q4571989) (← links)
- Maintaining spanning trees of small diameter (Q4632429) (← links)
- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Q4645175) (← links)
- Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. (Q5002718) (← links)
