Pages that link to "Item:Q1838310"
From MaRDI portal
The following pages link to A data structure for dynamic trees (Q1838310):
Displaying 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Dynamic suffix tree and two-dimensional texts management (Q287000) (← links)
- Document retrieval with one wildcard (Q287451) (← links)
- Reporting consecutive substring occurrences under bounded gap constraints (Q294948) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Categorified Reeb graphs (Q309649) (← links)
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Dynamic algorithms for monotonic interval scheduling problem (Q476865) (← links)
- Maintaining centdians in a fully dynamic forest with top trees (Q479062) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Maximum flow in directed planar graphs with vertex capacities (Q634675) (← links)
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges (Q729890) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Tree path majority data structures (Q784481) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Routing on heavy-path WSPD-spanners (Q832910) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Generating pseudo-random permutations and maximum flow algorithms (Q915489) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Efficient algorithms for computing Reeb graphs (Q924077) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Confluently persistent tries for efficient version control (Q970608) (← links)
- Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Two flow network simplification algorithms (Q1045934) (← links)
- New labeling procedures for the basis graph in generalized networks (Q1062633) (← links)
