Pages that link to "Item:Q672408"
From MaRDI portal
The following pages link to Simple linear time recognition of unit interval graphs (Q672408):
Displayed 12 items.
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)