Pages that link to "Item:Q5441357"

The following pages link to Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357):

Displayed 50 items.

• Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) ‎ (← links)
• Connectivity games over dynamic networks (Q391110) ‎ (← links)
• The \(O(n)\) loop model on a three-dimensional lattice (Q447310) ‎ (← links)
• The saga of minimum spanning trees (Q458468) ‎ (← links)
• Computing the map of geometric minimal cuts (Q476438) ‎ (← links)
• Worm Monte Carlo study of the honeycomb-lattice loop model (Q632406) ‎ (← links)
• \(f\)-sensitivity distance oracles and routing schemes (Q692635) ‎ (← links)
• New results on optimizing rooted triplets consistency (Q708349) ‎ (← links)
• The binary perfect phylogeny with persistent characters (Q714807) ‎ (← links)
• Fast compatibility testing for rooted phylogenetic trees (Q724246) ‎ (← links)
• Incomplete directed perfect phylogeny in linear time (Q832858) ‎ (← links)
• Upper and lower bounds for fully retroactive graph problems (Q832892) ‎ (← links)
• Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) ‎ (← links)
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) ‎ (← links)
• Efficient algorithms for computing Reeb graphs (Q924077) ‎ (← links)
• Algorithms for computing a parameterized \(st\)-orientation (Q959815) ‎ (← links)
• Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) ‎ (← links)
• Maintaining dynamic minimum spanning trees: an experimental study (Q968158) ‎ (← links)
• Dynamic mechanism design (Q1014626) ‎ (← links)
• Dynamic connectivity for axis-parallel rectangles (Q1016519) ‎ (← links)
• Optimal decremental connectivity in planar graphs (Q1693990) ‎ (← links)
• On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model (Q1706299) ‎ (← links)
• New heuristics for rooted triplet consistency (Q1736566) ‎ (← links)
• Discovering recurring activity in temporal networks (Q1741356) ‎ (← links)
• The matroid structure of representative triple sets and triple-closure computation (Q1746594) ‎ (← links)
• Reconstructing gene trees from Fitch's xenology relation (Q1789081) ‎ (← 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)
• Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) ‎ (← links)
• Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) ‎ (← links)
• Approximating dynamic weighted vertex cover with soft capacities (Q2072101) ‎ (← links)
• Dynamic kernels for hitting sets and set packing (Q2093581) ‎ (← links)
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) ‎ (← links)
• Percolation on complex networks: theory and application (Q2231806) ‎ (← links)
• Work-sensitive dynamic complexity of formal languages (Q2233429) ‎ (← links)
• Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) ‎ (← links)
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) ‎ (← links)
• How to use spanning trees to navigate in graphs (Q2375948) ‎ (← links)
• A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph (Q2391712) ‎ (← links)
• Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) ‎ (← links)
• Fully dynamic all pairs shortest paths with real edge weights (Q2496318) ‎ (← links)
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) ‎ (← links)
• Trade-offs in dynamic coloring for bipartite and general graphs (Q2696273) ‎ (← links)
• Randomization for Efficient Dynamic Graph Algorithms (Q2795930) ‎ (← 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)
• A Game Theoretic Approach to the Analysis of Dynamic Networks (Q2864354) ‎ (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) ‎ (← links)