Pages that link to "Item:Q1149762"
From MaRDI portal
The following pages link to A linear-time recognition algorithm for interval dags (Q1149762):
Displayed 10 items.
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- Chain dominated orders (Q862975) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- On-line algorithms for orders (Q1392200) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- Split orders (Q1422429) (← links)
- Note on scheduling intervals on-line (Q1805461) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- The jump number problem on interval orders: A 3/2 approximation algorithm (Q1898347) (← links)
- Profile Scheduling of Opposing Forests and Level Orders (Q3698629) (← links)