Pages that link to "Item:Q1398021"
From MaRDI portal
The following pages link to An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs (Q1398021):
Displaying 8 items.
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- An efficient algorithm to find next-to-shortest path on permutation graphs (Q1034978) (← links)
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
