Efficiency of a Good But Not Linear Set Union Algorithm

Cited in

(only showing first 100 items - show all)

Finding a feasible flow in a strongly connected network
Salembier's min-tree algorithm turned into breadth first search
Combination of convex theories: modularity, deduction completeness, and explanation
On-line computation of transitive closures of graphs
A linear-time algorithm for a special case of disjoint set union
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Most and least uniform spanning trees
An augmenting path algorithm for linear matroid parity
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
Almost linear upper bounds on the length of general Davenport-Schinzel sequences
Computing on a free tree via complexity-preserving mappings
Unification problems with one-sided distributivity
Fast algorithms for testing unsatisfiability of ground Horn clauses with equations
A practically efficient and almost linear unification algorithm
The general maximum matching algorithm of Micali and Vazirani
An inherently iterative computation of Ackermann's function
A topological approach to dynamic graph connectivity
A simplified construction of nonlinear Davenport-Schinzel sequences
Proof of a conjecture of Erdős and Turán
A linear systolic algorithm for the connected component problem
Worst-case analysis of the set-union problem with extended backtracking
On the relationship of congruence closure and unification
Lexicographic permutations with restrictions
An efficient PQ-graph algorithm for solving the graph-realization problem
Ranking arborescences in O(Km log n) time
An \(O(EV\log^2V)\) algorithm for the maximal flow problem
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
An algorithm for testing lossless join property in relational databases
Pathlistings applied to data flow analysis
Finding connected components of an intersection graph of squares in the Euclidean plane
Unifications, deunifications, and their complexity
Finding the most vital edge with respect to minimum spanning tree in weighted graphs
Maintaining bridge-connected and biconnected components on-line
Generalized Davenport-Schinzel sequences with linear upper bound
\(P_ 4\)-trees and substitution decomposition
An optimal algorithm for the period of a strongly connected digraph
Randomized range-maxima in nearly-constant parallel time
Edge-disjoint spanning trees and depth-first search
Testing flow graph reducibility
Linear expected time of a simple union-find algorithm
Linear unification
Space-time trade off in implementing certain set operations
A new data structure for the UNION-FIND problem
A fast algorithm for constructing a tree automaton recognizing a congruential tree language
A fast algorithm for finding interlocking sets
Efficient Union-Find for planar graphs and other sparse graph classes
Extremal problems for colored trees and Davenport-Schinzel sequences
On constructing the elimination tree
Testing string superprimitivity in parallel
A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Learning deterministic even linear languages from positive examples
Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
Finding the most vital node of a shortest path.
Dynamic orthogonal range queries in OLAP.
A faster computation of the most vital edge of a shortest path
2-vertex connectivity in directed graphs
On the gold standard for security of universal steganography
Recognizing union-find trees is NP-complete
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
Optimal decremental connectivity in planar graphs
Conditional congruence closure over uninterpreted and interpreted symbols
Efficient region segmentation on compressed gray images using quadtree and shading representation
Quasi-optimal range searching in spaces of finite VC-dimension
Solving some combinatorial problems on arrays with one-way dataflow
A data structure for dynamic trees
Parallel preprocessing for path queries without concurrent reading.
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
Computing contour trees in all dimensions
Lazy structure sharing for query optimization
On the \(k\)-coloring of intervals
Unique satisfiability of Horn sets can be solved in nearly linear time
Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
On the probabilistic min spanning tree problem
Power domination in circular-arc graphs
Improved bounds for finger search on a RAM
A fully dynamic graph algorithm for recognizing interval graphs
Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method
Aggregation-based minimization of finite state automata
Simpler proofs with decentralized invariants
Smallest \(k\)-enclosing rectangle revisited
Algebraic Bayesian networks: checking backbone connectivity
Concurrent disjoint set union
Constructing light spanners deterministically in near-linear time
Bipartite completion of colored graphs avoiding chordless cycles of given lengths
Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
Finding the gapped longest common subsequence by incremental suffix maximum queries
Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
Approximate range searching: The absolute model
Fast connected-component labeling
Bisimulation and coinduction enhancements: a historical perspective
Dynamic interpolation search revisited
On the König deficiency of zero-reducible graphs
Faster graph bipartization
Comparative study and proof of single-pass connected components algorithms
Oriented Euler complexes and signed perfect matchings
A new algorithm for the minimum spanning tree verification problem
A feasibility study for a persistent homology-based \(k\)-nearest neighbor search algorithm in melanoma detection

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)