Pages that link to "Item:Q1062461"
From MaRDI portal
The following pages link to A linear-time algorithm for a special case of disjoint set union (Q1062461):
Displaying 50 items.
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243) (← links)
- Optimal on-line decremental connectivity in trees (Q290266) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- A fast algorithm for multiplying min-sum permutations (Q411869) (← links)
- Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique (Q487628) (← links)
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- A linear algorithm for MLL proof net correctness and sequentialization (Q534705) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- The level ancestor problem simplified (Q596133) (← links)
- A simple and efficient union-find-delete algorithm (Q620968) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Two linear time Union--Find strategies for image processing (Q672744) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- Complete bound consistency for the global cardinality constraint (Q816681) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Edge-disjoint paths in a grid bounded by two nested rectangles (Q913521) (← links)
- Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878) (← links)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061) (← links)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- Computing the bump number with techniques from two-processor scheduling (Q1106865) (← links)
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- Unifications, deunifications, and their complexity (Q1173920) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Efficient parallel algorithms for path problems in directed graphs (Q1186791) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- Efficient Union-Find for planar graphs and other sparse graph classes (Q1274324) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
