Pages that link to "Item:Q4561265"

The following pages link to A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265):

Displaying 11 items.

• On some graphs with a unique perfect matching (Q1799576) (← links)
• Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• The power of linear-time data reduction for maximum matching (Q2211355) (← 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)
• (Q5091230) (← links)
• The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
• (Q5874479) (← links)
• Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
• Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)