Treewidth computations. I: Upper bounds (Q964001): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Boost
@@ Property / describes a project that uses: Boost / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ComputeTW
@@ Property / describes a project that uses: ComputeTW / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+BGL
@@ Property / describes a project that uses: BGL / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Treewidthlib
@@ Property / describes a project that uses: Treewidthlib / 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.ic.2009.03.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2116793595
@@ Property / OpenAlex ID: W2116793595 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59567681
@@ Property / Wikidata QID: Q59567681 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Linear-time computation of optimal subgraphs of decomposable graphs
+Normal rank
@@ Property / cites work @@
+Solving partial constraint satisfaction problems with tree decomposition
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Q3740231
@@ Property / cites work: Q3740231 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of structural CSP decomposition methods
+Normal rank
@@ Property / cites work @@
+Q4734791
@@ Property / cites work: Q4734791 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth computations. II. Lower bounds
@@ Property / cites work: Treewidth computations. II. Lower bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q4099676
@@ Property / cites work: Q4099676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4237089
@@ Property / cites work: Q4237089 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216652
@@ Property / cites work: Q3216652 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684121
@@ Property / cites work: Q3684121 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+SOFSEM 2005: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Q2816028
@@ Property / cites work: Q2816028 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4407447
@@ Property / cites work: Q4407447 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Representations of chordal graphs as subtrees of a tree
+Normal rank
@@ Property / cites work @@
+The Use of Linear Graphs in Gauss Elimination
@@ Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank @@
+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 @@
+Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4414480
@@ Property / cites work: Q4414480 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cardinality search for computing minimal triangulations of graphs
+Normal rank
@@ Property / cites work @@
+Lex M versus MCS-M
@@ Property / cites work: Lex M versus MCS-M / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+The Elimination form of the Inverse and its Application to Linear Programming
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Q4426346
@@ Property / cites work: Q4426346 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and metaheuristic methods for computing graph treewidth
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Finding good tree decompositions by local search
@@ Property / cites work: Finding good tree decompositions by local search / rank @@
+Normal rank
@@ Property / cites work @@
+On Exact Algorithms for Treewidth
@@ Property / cites work: On Exact Algorithms for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficiently fast algorithm for finding close to optimal clique trees
+Normal rank
@@ Property / cites work @@
+On treewidth approximations.
@@ Property / cites work: On treewidth approximations. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+Normal rank
@@ Property / cites work @@
+Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Chordal Graphs
@@ Property / cites work: A Separator Theorem for Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Role of Elimination Trees in Sparse Factorization
+Normal rank
@@ Property / cites work @@
+A practical algorithm for making filled graphs minimal
+Normal rank
@@ Property / cites work @@
+Q4252378
@@ Property / cites work: Q4252378 / rank @@
+Normal rank
@@ Property / cites work @@
+A wide-range algorithm for minimal triangulation from an arbitrary ordering
+Normal rank
@@ Property / cites work @@
+Q4373676
@@ Property / cites work: Q4373676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411390
@@ Property / cites work: Q4411390 / rank @@
+Normal rank
@@ Property / cites work @@
+A vertex incremental approach for maintaining chordality
+Normal rank
@@ Property / cites work @@
+Minimal Orderings Revisited
@@ Property / cites work: Minimal Orderings Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
+Normal rank
@@ Property / cites work @@
+Contraction and Treewidth Lower Bounds
@@ Property / cites work: Contraction and Treewidth Lower Bounds / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:964001