Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895): Difference between revisions

@@ Property / Wikidata QID @@
+Q57010789
@@ Property / Wikidata QID: Q57010789 / rank @@
+Normal rank
@@ 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/j.ipl.2004.06.019
+Normal rank
@@ Property / OpenAlex ID @@
+W1999414674
@@ Property / OpenAlex ID: W1999414674 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Graphs with not too many spanning trees
@@ Property / cites work: Graphs with not too many spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum common subgraph problem
+Normal rank
@@ Property / cites work @@
+Q3998976
@@ Property / cites work: Q3998976 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding iso- and other morphisms for partial \(k\)- trees
+Normal rank
@@ Property / cites work @@
+Video indexing and similarity retrieval by largest common subgraph detection using decision trees
+Normal rank