Pages that link to "Item:Q3048273"

The following pages link to Applications of Path Compression on Balanced Trees (Q3048273):

Displaying 46 items.

• Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
• An optimal EREW PRAM algorithm for minimum spanning tree verification (Q290239) (← links)
• Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
• Finding dominators via disjoint set union (Q396673) (← links)
• Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
• Computing all the best swap edges distributively (Q436830) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• Improved filtering for weighted circuit constraints (Q487627) (← links)
• Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
• Properties of data flow frameworks: A unified model (Q910237) (← links)
• A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
• A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
• Linear verification for spanning trees (Q1066909) (← links)
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
• Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
• Finding the \(k\) smallest spanning trees (Q1196455) (← links)
• Parallel search algorithms for graphs and trees (Q1204800) (← links)
• A fast and simple Steiner routing heuristic (Q1276958) (← links)
• Optimal binary trees with order constraints (Q1283811) (← links)
• Efficient algorithms for finding the most vital edge of a minimum spanning tree (Q1313724) (← links)
• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
• A simpler minimum spanning tree verification algorithm (Q1355729) (← links)
• The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
• A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
• A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
• Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
• Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
• A data structure for dynamic trees (Q1838310) (← links)
• Distributed verification of minimum spanning trees (Q1954247) (← links)
• Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812) (← links)
• Memory-efficient fixpoint computation (Q2233524) (← links)
• A new algorithm for the minimum spanning tree verification problem (Q2340495) (← links)
• Optimal parallel verification of minimum spanning trees in logarithmic time (Q2365173) (← links)
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
• Faster swap edge computation in minimum diameter spanning trees (Q2428664) (← links)
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems (Q2639778) (← links)
• A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
• Path Minima in Incremental Unrooted Trees (Q3541117) (← links)
• Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree^∗ (Q4511611) (← links)
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)
• Finding the k smallest spanning trees (Q5056090) (← links)
• A simpler minimum spanning tree verification algorithm (Q5057455) (← links)
• Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
• A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043) (← links)
• Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
• A weight-scaling algorithm for \(f\)-factors of multigraphs (Q6046950) (← links)