Pages that link to "Item:Q1902306"
From MaRDI portal
The following pages link to Finding a maximum matching in a permutation graph (Q1902306):
Displaying 6 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- On two-processor scheduling and maximum matching in permutation graphs (Q1351633) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)