Pages that link to "Item:Q1838310"
From MaRDI portal
The following pages link to A data structure for dynamic trees (Q1838310):
Displaying 50 items.
- Scaling algorithms for network problems (Q1079135) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
- On finding most uniform spanning trees (Q1102979) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- Finding paths and deleting edges in directed acyclic graphs (Q1115184) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (Q1266709) (← links)
- Labelled trees and pairs of input--output permutations in priority queues (Q1275072) (← links)
- Computational investigations of maximum flow algorithms (Q1278652) (← links)
- Diagnosing infeasibilities in network flow problems (Q1290604) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- Complexity models for incremental computation (Q1331947) (← links)
- Dynamic dictionary matching (Q1337462) (← links)
- Dynamic expression trees (Q1346771) (← links)
- A note on finding compact sets in graphs represented by an adjacency list (Q1351637) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time (Q1384532) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- On indexed data broadcast (Q1577012) (← links)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries (Q1615774) (← links)
- A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks (Q1673339) (← links)
- A fast scaling algorithm for the weighted triangle-free 2-matching problem (Q1678085) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- Avoiding the global sort: a faster contour tree algorithm (Q1688860) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Sorting signed permutations by reversals using link-cut trees (Q1705654) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- Reconstructing edge-disjoint paths faster (Q1785736) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- The nearest common ancestor in a dynamic tree (Q1821561) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Matching games with partial information (Q1873933) (← links)
- A generalization of the scaling max-flow algorithm (Q1885993) (← links)
- Fully dynamic biconnectivity in graphs (Q1892579) (← links)
- Linear-size nonobtuse triangulation of polygons (Q1906045) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
