The subgraph isomorphism problem for outerplanar graphs (Q1056237): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(82)90133-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2172037773
@@ Property / OpenAlex ID: W2172037773 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with forbidden subgraphs
@@ Property / cites work: Graphs with forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4121921
@@ Property / cites work: Q4121921 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Subtree Isomorphism in O(n5/2)
@@ Property / cites work: Subtree Isomorphism in O(n5/2) / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithms to recognize outerplanar and maximal outerplanar graphs
+Normal rank
@@ Property / cites work @@
+An Analysis of a Good Algorithm for the Subtree Problem
+Normal rank
@@ Property / cites work @@
+Q4179030
@@ Property / cites work: Q4179030 / rank @@
+Normal rank