Pages that link to "Item:Q5006595"
From MaRDI portal
The following pages link to Efficient maximum matching algorithms for trapezoid graphs (Q5006595):
Displaying 4 items.
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- An efficient algorithm to solve connectivity problem on trapezoid graphs (Q2454971) (← links)
- An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm (Q4957968) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)