Efficiency of a Good But Not Linear Set Union Algorithm

Cited in

(only showing first 100 items - show all)

A note on set union with arbitrary deunions
Some results of the relocation problems with processing times and deadlines
Amortized Computational Complexity
On updating the structure of sparse matrix factors
Parallel preprocessing for path queries without concurrent reading.
scientific article; zbMATH DE number 7765396 (Why is no real title available?)
Source-tracking unification
Depth First Search in the Semi-streaming Model
Extremal problems for colored trees and Davenport-Schinzel sequences
Incremental NFA minimization
Finding dominators via disjoint set union
Another variation on the common subexpression problem
Three generalizations of Davenport-Schinzel sequences
OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS
Fast algorithms for the undirected negative cost cycle detection problem
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
A linear algorithm for MLL proof net correctness and sequentialization
Power domination in circular-arc graphs
Testing string superprimitivity in parallel
A survey of direct methods for sparse linear systems
Upper and lower bounds for fully retroactive graph problems
Path constraints in semistructured data
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
Fast congruence closure and extensions
Space-time trade off in implementing certain set operations
New constructions for provably-secure time-bound hierarchical key assignment schemes
A complement to Tarjan's result about the lower bound on the complexity of the set union problem
A linear-time recognition algorithm for interval dags
Bisimulation and coinduction enhancements: a historical perspective
Fast algorithms for testing unsatisfiability of ground Horn clauses with equations
Fast reoptimization for the minimum spanning tree problem
Sparse linear least-squares problems
Fast connected-component labeling
A linear systolic algorithm for the connected component problem
Computing the 4-edge-connected components of a graph: an experimental study
Efficient data race detection for async-finish parallelism
Conditional congruence closure over uninterpreted and interpreted symbols
Pyramid segmentation algorithms revisited
Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
A note on Arc tolerances in sparse shortest-path and network flow problems
Finding strong components using depth-first search
Strong articulation points and strong bridges in large scale graphs
Design and implementation of an efficient priority queue
Comparative study and proof of single-pass connected components algorithms
A new data structure for the UNION-FIND problem
First Results for 3D Image Segmentation with Topological Map
On the relationship of congruence closure and unification
Provably robust simplification of component trees of multidimensional images
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
Unifications, deunifications, and their complexity
An inherently iterative computation of Ackermann's function
Unification theory
A Compact Representation for Syntactic Dependencies in QBFs
Fast incremental planarity testing
Smallest k-enclosing rectangle revisited
Four Soviets walk the dog: improved bounds for computing the Fréchet distance
Simple and optimal output-sensitive construction of contour trees using monotone paths
Computing on a free tree via complexity-preserving mappings
Incremental DFA minimisation
Small hop-diameter sparse spanners for doubling metrics
A simple and efficient union-find-delete algorithm
Recognizing union-find trees is NP-complete, even without rank info
On-line computation of transitive closures of graphs
A parallel edge orientation algorithm for quadrilateral meshes
The Todd-Coxeter algorithm for semigroups and monoids
Unique satisfiability of Horn sets can be solved in nearly linear time
Efficient Union-Find for planar graphs and other sparse graph classes
A tight lower bound for top-down skew heaps
Almost linear upper bounds on the length of general Davenport-Schinzel sequences
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
Good r-divisions imply optimal amortized decremental biconnectivity
A simplified construction of nonlinear Davenport-Schinzel sequences
Maintaining bridge-connected and biconnected components on-line
Dynamic orthogonal range queries in OLAP.
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
A state-of-the-art review of parallel-machine scheduling research
Generalized Davenport-Schinzel sequences with linear upper bound
An O(n^2) algorithm for computing optimal continuous voltage schedules
On the minimum depth of circuits with linear number of wires encoding good codes
A decomposition algorithm for nested resource allocation problems
Minimization of finite state automata through partition aggregation
A linear-time algorithm for a special case of disjoint set union
Finding the most vital node of a shortest path.
Path-based depth-first search for strong and biconnected components
Lazy structure sharing for query optimization
Linear-space S-table algorithms for the longest common subsequence problem
Aggregation-based minimization of finite state automata
Simpler proofs with decentralized invariants
Point location in dynamic planar subdivisions
Smallest \(k\)-enclosing rectangle revisited
Edge-disjoint spanning trees and depth-first search
2-vertex connectivity in directed graphs
Making the interval membership width of temporal graphs connected and bidirectional
Finding a feasible flow in a strongly connected network
A feasibility study for a persistent homology-based \(k\)-nearest neighbor search algorithm in melanoma detection
Level set tree methods
Ranking arborescences in O(Km log n) time
A data structure for dynamic trees
Finding the gapped longest common subsequence by incremental suffix maximum queries
Max-coloring paths: tight bounds and extensions

This page was built for publication: Efficiency of a Good But Not Linear Set Union Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065031)