Complexity of Finding Embeddings in a k-Tree (Q3751595): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1137/0608024
@@ Property / full work available at URL: https://doi.org/10.1137/0608024 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2085550081
@@ Property / OpenAlex ID: W2085550081 / rank @@
+Normal rank
@@ Property / cites work @@
+Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Characterization and Recognition of Partial 3-Trees
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3218070
@@ Property / cites work: Q3218070 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees
+Normal rank
@@ Property / cites work @@
+Networks immune to isolated failures
@@ Property / cites work: Networks immune to isolated failures / rank @@
+Normal rank
@@ Property / cites work @@
+Networks immune to isolated line failures
@@ Property / cites work: Networks immune to isolated line failures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of Comparability Graphs and of Interval Graphs
+Normal rank
@@ Property / cites work @@
+Separating subgraphs in k-trees: Cables and caterpillars
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank

Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595): Difference between revisions

Latest revision as of 17:22, 17 June 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)