Pages that link to "Item:Q4870967"
From MaRDI portal
The following pages link to Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967):
Displaying 8 items.
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs (Q1680868) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532) (← links)
- The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
