A combinatorial optimization algorithm for solving the branchwidth problem (Q429498): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128021849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Exact Algorithms for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction and Treewidth Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / 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: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing branchwidth via efficient triangulations and blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch decompositions and minor containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs, branchwidth, and tangles! Oh my! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Branch Decompositions II: The Cycle Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete / 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: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 08:34, 5 July 2024

scientific article
Language Label Description Also known as
English
A combinatorial optimization algorithm for solving the branchwidth problem
scientific article

    Statements

    A combinatorial optimization algorithm for solving the branchwidth problem (English)
    0 references
    0 references
    0 references
    0 references
    19 June 2012
    0 references
    branch decomposition
    0 references
    branchwidth
    0 references
    implicit enumeration
    0 references
    partitioning
    0 references

    Identifiers