A note on exact algorithms for vertex ordering problems on graphs (Q692902): Difference between revisions

@@ Property / DOI @@
-.1007/s00224-011-9312-0
@@ Property / DOI: 10.1007/s00224-011-9312-0 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q59567532
@@ Property / Wikidata QID: Q59567532 / 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.1007/s00224-011-9312-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2143693959
@@ Property / OpenAlex ID: W2143693959 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+On Exact Algorithms for Treewidth
@@ Property / cites work: On Exact Algorithms for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and metaheuristic methods for computing graph treewidth
+Normal rank
@@ Property / cites work @@
+Fugitive-search games on graphs and related parameters
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Expected Computation Time for Hamiltonian Path problem
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Q5417641
@@ Property / cites work: Q5417641 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Pathwidth Faster Than 2 n
@@ Property / cites work: Computing Pathwidth Faster Than 2 n / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / DOI @@
+.1007/S00224-011-9312-0
@@ Property / DOI: 10.1007/S00224-011-9312-0 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:692902