Pages that link to "Item:Q5466762"
From MaRDI portal
The following pages link to An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762):
Displaying 3 items.
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- An efficient algorithm for finding all hinge vertices on trapezoid graphs (Q1405798) (← links)
- The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs (Q2731130) (← links)