Pages that link to "Item:Q4065031"
From MaRDI portal
The following pages link to Efficiency of a Good But Not Linear Set Union Algorithm (Q4065031):
Displaying 50 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- A tight lower bound for top-down skew heaps (Q287017) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- Multivariate topology simplification (Q340525) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Extending common intervals searching from permutations to sequences (Q473211) (← links)
- Fast sequential importance sampling to estimate the graph reliability polynomial (Q476443) (← links)
- A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- A linear algorithm for MLL proof net correctness and sequentialization (Q534705) (← links)
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- A simple and efficient union-find-delete algorithm (Q620968) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Two linear time Union--Find strategies for image processing (Q672744) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- Another variation on the common subexpression problem (Q685700) (← links)
- Simple and optimal output-sensitive construction of contour trees using monotone paths (Q705555) (← links)
- Finding an anti-risk path between two nodes in undirected graphs (Q732313) (← links)
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree (Q733556) (← links)
- High girth augmented trees are huge (Q739384) (← links)
- A note on set union with arbitrary deunions (Q751279) (← links)
- A practical unification algorithm (Q751312) (← links)
- The set union problem with dynamic weighted backtracking (Q804287) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Fast congruence closure and extensions (Q876046) (← links)
- On the row merge tree for sparse LU factorization with partial pivoting (Q878210) (← links)
- An efficient abstract machine for safe ambients (Q882488) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- A note on data structures for maintaining bipartitions (Q924550) (← links)
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
- Using bisimulation proof techniques for the analysis of distributed abstract machines (Q935472) (← links)
- New constructions for provably-secure time-bound hierarchical key assignment schemes (Q954992) (← links)
- Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
- Finding a feasible flow in a strongly connected network (Q1003481) (← links)
- Salembier's min-tree algorithm turned into breadth first search (Q1029019) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
