A Local Search Algorithm for Branchwidth (Q3075536): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): conf/sofsem/OverwijkPB11, #quickstatements; #temporary_batch_1731543907597
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_37 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1753421735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on 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: Treewidth: Characterizations, Applications, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive linear time algorithms for branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and metaheuristic methods for computing graph treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm / 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: New upper bounds on the decomposability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Branch Decompositions I: The Ratcatcher / 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: Graph minors. II. Algorithmic aspects of tree-width / 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: Call routing and the ratcatcher / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/sofsem/OverwijkPB11 / rank
 
Normal rank

Latest revision as of 01:51, 14 November 2024

scientific article
Language Label Description Also known as
English
A Local Search Algorithm for Branchwidth
scientific article

    Statements

    A Local Search Algorithm for Branchwidth (English)
    0 references
    0 references
    0 references
    0 references
    15 February 2011
    0 references

    Identifiers