Pages that link to "Item:Q4377592"
From MaRDI portal
The following pages link to Sparsification—a technique for speeding up dynamic graph algorithms (Q4377592):
Displaying 50 items.
- Categorified Reeb graphs (Q309649) (← links)
- Mining preserving structures in a graph sequence (Q344786) (← links)
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Influence of assortativity and degree-preserving rewiring on the spectra of networks (Q614567) (← links)
- A formal verification technique for behavioural model-to-model transformations (Q682361) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
- Adjacency queries in dynamic sparse graphs (Q846004) (← links)
- Two methods for the generation of chordal graphs (Q940844) (← links)
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- Static and dynamic parallel computation of connected components (Q1322111) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Separator based sparsification. I: Planarity testing and minimum spanning trees (Q1915501) (← links)
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- An efficient algorithm for batch stability testing (Q1959725) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Optimal per-edge processing times in the semi-streaming model (Q2380006) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Algorithms for placing monitors in a flow network (Q2441585) (← links)
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)
- Single-pass streaming algorithms to partition graphs into few forests (Q2695324) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- Algorithms on evolving graphs (Q2826051) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Speeding up Graph Algorithms via Switching Classes (Q2946059) (← 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)
- Efficient data structures for sparse network representation (Q3523690) (← links)
- (Q4230327) (← links)
- Clustering for faster network simplex pivots (Q4488857) (← links)
- Configuring Random Graph Models with Fixed Degree Sequences (Q4641712) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- (Q5092428) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- The Online House Numbering Problem: Min-Max Online List Labeling (Q5111720) (← links)
- (Q5111875) (← links)