Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.08.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003591274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_{1,3}\)-free and \(W_4\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank

Latest revision as of 19:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
scientific article

    Statements

    Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (English)
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic programming
    0 references
    tree-decomposition
    0 references
    branch-decomposition
    0 references
    path-decomposition
    0 references
    dominating set
    0 references
    brachwidth
    0 references
    treewidth
    0 references
    0 references