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 13 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)
- 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)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- (Q4488859) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5090996) (← links)
- (Q5091230) (← links)
