A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/siamcomp/BodlaenderDDFLP16, #quickstatements; #temporary_batch_1731530891435
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2313886575 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.6321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. I: Sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Hamiltonicity Checking Via Bases of Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving partial constraint satisfaction problems with tree decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Tree Contraction Part 2: Further Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/siamcomp/BodlaenderDDFLP16 / rank
 
Normal rank

Latest revision as of 22:19, 13 November 2024

scientific article
Language Label Description Also known as
English
A $c^k n$ 5-Approximation Algorithm for Treewidth
scientific article

    Statements

    A $c^k n$ 5-Approximation Algorithm for Treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 April 2016
    0 references
    algorithms
    0 references
    graphs
    0 references
    treewidth
    0 references
    approximation
    0 references
    fixed parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers