Pages that link to "Item:Q4089769"
From MaRDI portal
The following pages link to On Finding Lowest Common Ancestors in Trees (Q4089769):
Displaying 20 items.
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- On pattern matching with \(k\) mismatches and few don't cares (Q344551) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- The nearest common ancestor in a dynamic tree (Q1821561) (← links)
- A data structure for dynamic trees (Q1838310) (← links)
- Decomposition of triply rooted trees (Q1953487) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- The longest common substring problem (Q2971067) (← links)
- A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
- On computing distances between leaves in a complete tree (Q3890125) (← links)
- Searching and encoding for infinite ordered sets (Q3933757) (← links)
- Parallel dynamic lowest common ancestors (Q5054770) (← links)
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint (Q5387633) (← links)
- Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (Q5858647) (← links)
- Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees (Q6103520) (← links)
