On maximum common subgraph problems in series-parallel graphs (Q1678090): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejc.2017.07.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2963589575
@@ Property / OpenAlex ID: W2963589575 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q115926592
@@ Property / Wikidata QID: Q115926592 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A tighter insertion-based approximation of the crossing number
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential and parallel algorithms for embedding problems on classes of partial k-trees
+Normal rank
@@ Property / cites work @@
+The complexity of subgraph isomorphism for classes of partial k-trees
+Normal rank
@@ Property / cites work @@
+Q4472293
@@ Property / cites work: Q4472293 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient frequent connected subgraph mining in graphs of bounded tree-width
+Normal rank
@@ Property / cites work @@
+On Maximum Common Subgraph Problems in Series-Parallel Graphs
+Normal rank
@@ Property / cites work @@
+Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding iso- and other morphisms for partial \(k\)- trees
+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 @@
+The edge-disjoint paths problem is NP-complete for series-parallel graphs
+Normal rank
@@ Property / cites work @@
+Effective feature construction by maximum common subgraph sampling
+Normal rank
@@ Property / cites work @@
+A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
+Normal rank
@@ Property / cites work @@
+The subgraph isomorphism problem for outerplanar graphs
+Normal rank