An O(n) time algorithm for maximum matching on cographs
From MaRDI portal
Publication:685476
Cites work
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A simple parallel tree contraction algorithm
- An Amortized Analysis of Insertions into AVL-Trees
- Clustering and domination in perfect graphs
- Complement reducible graphs
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
Cited in
(15)- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- On adaptive algorithms for maximum matching
- Role colouring graphs in hereditary classes
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
- Linear-time algorithm for the matched-domination problem in cographs
- scientific article; zbMATH DE number 279491 (Why is no real title available?)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- On some graphs with a unique perfect matching
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- Finding a maximum matching in a permutation graph
- scientific article; zbMATH DE number 1003276 (Why is no real title available?)
- Maximum matching in almost linear time on graphs of bounded clique-width
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- scientific article; zbMATH DE number 1471731 (Why is no real title available?)
- scientific article; zbMATH DE number 7561360 (Why is no real title available?)
This page was built for publication: An O(\(n\)) time algorithm for maximum matching on cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685476)
