Pages that link to "Item:Q287094"
From MaRDI portal
The following pages link to An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094):
Displaying 5 items.
- 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)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5091230) (← links)