Pages that link to "Item:Q1969958"
From MaRDI portal
The following pages link to Parallel algorithms for maximum matching in complements of interval graphs and related problems (Q1969958):
Displaying 6 items.
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- (Q3732972) (← links)
- (Q4452099) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)