Pages that link to "Item:Q2093582"
From MaRDI portal
The following pages link to Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582):
Displaying 4 items.
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- (Q3161275) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)