Pages that link to "Item:Q671396"
From MaRDI portal
The following pages link to A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396):
Displayed 3 items.
- The recognition of geodetically connected graphs (Q293190) (← links)
- Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph'' (Q1944158) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)