Pages that link to "Item:Q1034978"
From MaRDI portal
The following pages link to An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978):
Displaying 5 items.
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
