An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Q3899969
@@ Property / cites work: Q3899969 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Decomposition Theory
@@ Property / cites work: A Combinatorial Decomposition Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3836509
@@ Property / cites work: Q3836509 / rank @@
+Normal rank
@@ Property / cites work @@
+A tree representation for \(P_ 4\)-sparse graphs
@@ Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a unique tree representation for \(P_ 4\)-extendible graphs
+Normal rank
@@ Property / cites work @@
+A New Class of Brittle Graphs
@@ Property / cites work: A New Class of Brittle Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal parallel matching algorithm for cographs
+Normal rank
@@ Property / cites work @@
+Q3683903
@@ Property / cites work: Q3683903 / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
+Normal rank
@@ Property / cites work @@
+An O(\(n\)) time algorithm for maximum matching on cographs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(97)00081-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2062510888
@@ Property / OpenAlex ID: W2062510888 / rank @@
+Normal rank