Pages that link to "Item:Q1405798"
From MaRDI portal
The following pages link to An efficient algorithm for finding all hinge vertices on trapezoid graphs (Q1405798):
Displayed 4 items.
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph'' (Q1944158) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)