Pages that link to "Item:Q1366304"
From MaRDI portal
The following pages link to An optimal algorithm to find the jump number of partially ordered sets (Q1366304):
Displaying 16 items.
- The number of depth-first searches of an ordered set (Q909681) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- Tackling the jump number of interval orders (Q1182058) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- Some optimal algorithms for decomposed partially ordered sets (Q1195861) (← links)
- Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
- An improved algorithm for the jump number problem (Q1603444) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Optimal jumping patterns (Q2880101) (← links)
- Fast Detection of Stable and Count Predicates in Parallel Computations (Q3300821) (← links)
- An optimal algorithm for finding all the jumps of a monotone step-function (Q3723701) (← links)
- Bounds for the jump number of partially ordered sets (Q3976789) (← links)
- (Q4836304) (← links)