Pages that link to "Item:Q1124331"
From MaRDI portal
The following pages link to An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331):
Displaying 5 items.
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505) (← links)
- On a universal chain problem (Q1317044) (← links)
- On two-processor scheduling and maximum matching in permutation graphs (Q1351633) (← links)
- Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)