Pages that link to "Item:Q1209984"

The following pages link to Finding a maximum matching in a circular-arc graph (Q1209984):

Displaying 9 items.

• Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
• Finding a maximum matching in a permutation graph (Q1902306) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)
• (Q5091230) (← links)