Pages that link to "Item:Q4653706"
From MaRDI portal
The following pages link to An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706):
Displaying 6 items.
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- The interval-merging problem (Q867634) (← links)
- Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes (Q2671810) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
