The following pages link to (Q4222504):
Displaying 4 items.
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- Some Efficient Algorithms for Permutation Graphs (Q4290917) (← links)
