Pages that link to "Item:Q685476"
From MaRDI portal
The following pages link to An O(\(n\)) time algorithm for maximum matching on cographs (Q685476):
Displaying 7 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- Finding a maximum matching in a permutation graph (Q1902306) (← links)
- Role colouring graphs in hereditary classes (Q2034782) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- (Q5090996) (← links)
- (Q5091230) (← links)
