A remark on the time complexity of the subtree problem (Q1249180): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4120604
@@ Property / cites work: Q4120604 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the marriage problem
@@ Property / cites work: On the complexity of the marriage problem / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A V log V algorithm for isomorphism of triconnected planar graphs
+Normal rank
@@ Property / cites work @@
+Q3875946
@@ Property / cites work: Q3875946 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4148000
@@ Property / cites work: Q4148000 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02252027
+Normal rank
@@ Property / OpenAlex ID @@
+W1986116426
@@ Property / OpenAlex ID: W1986116426 / rank @@
+Normal rank