Pages that link to "Item:Q598809"

The following pages link to A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809):

Displaying 47 items.

• Ripser: efficient computation of Vietoris-Rips persistence barcodes (Q133720) (← links)
• Efficient algorithms for the temporal precedence problem (Q293412) (← links)
• Max-coloring paths: tight bounds and extensions (Q454245) (← links)
• Two linear time Union--Find strategies for image processing (Q672744) (← links)
• Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
• A note on set union with arbitrary deunions (Q751279) (← links)
• The set union problem with dynamic weighted backtracking (Q804287) (← links)
• Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
• A note on predecessor searching in the pointer machine model (Q989469) (← links)
• Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
• The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
• A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
• Notes on the complexity of sorting in abstract machines (Q1068551) (← links)
• Fractional cascading. II: Applications (Q1099958) (← links)
• Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
• A complement to Tarjan's result about the lower bound on the complexity of the set union problem (Q1149259) (← links)
• Unifications, deunifications, and their complexity (Q1173920) (← links)
• Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
• Efficient Union-Find for planar graphs and other sparse graph classes (Q1274324) (← links)
• A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals (Q1332777) (← links)
• Unit-cost pointers versus logarithmic-cost addresses (Q1334674) (← links)
• Optimal decremental connectivity in planar graphs (Q1693990) (← links)
• Sorting signed permutations by reversals, revisited (Q1775771) (← links)
• Intersection reporting on two collections of disjoint sets (Q1818976) (← links)
• The nearest common ancestor in a dynamic tree (Q1821561) (← links)
• A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
• An optimal data structure to handle dynamic environments in non-deterministic computations (Q1869983) (← links)
• A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
• Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
• Simplex range reporting on a pointer machine (Q1917035) (← links)
• I/O efficient dynamic data structures for longest prefix queries (Q1939656) (← links)
• Improved bounds for finger search on a RAM (Q1950391) (← links)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
• Top tree compression of tries (Q2067669) (← links)
• Range minimum queries in minimal space (Q2078612) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• Dynamic interpolation search revisited (Q2288214) (← links)
• Parallel pointer machines (Q2366720) (← links)
• Polytopes associated with symmetry handling (Q2414904) (← links)
• Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
• Memory management for Union-Find algorithms (Q5047160) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• A New Lower Bound for Semigroup Orthogonal Range Searching (Q5088928) (← links)
• Heuristic Algorithms for the Maximum Colorful Subtree Problem (Q5090364) (← links)
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³ (Q5108270) (← links)
• Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions (Q6159411) (← links)