An O(\(n\)) time algorithm for maximum matching on cographs (Q685476): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(93)90230-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1966596093
@@ Property / OpenAlex ID: W1966596093 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple parallel tree contraction algorithm
@@ Property / cites work: A simple parallel tree contraction algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3676177
@@ Property / cites work: Q3676177 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+An Amortized Analysis of Insertions into AVL-Trees
+Normal rank