Pages that link to "Item:Q2659073"
From MaRDI portal
The following pages link to The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073):
Displaying 3 items.
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
