Treewidth computations. II. Lower bounds (Q549673): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ComputeTW / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BGL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Treewidthlib / rank
 
Normal rank
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.1016/j.ic.2011.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990761146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792909 / 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: Necessary edges in \(k\)-chordalisations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Exact Algorithms for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth lower bounds with brambles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum cardinality search lower bound for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction and Treewidth Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial optimization algorithm for solving the branchwidth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Branch Decompositions I: The Ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound for Tree-Width Using Maximum Cardinality Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-degree graph expansions that preserve treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Number of Obstructions to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boxicity and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral lower bound for the treewidth of a graph and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank

Latest revision as of 07:45, 4 July 2024

scientific article
Language Label Description Also known as
English
Treewidth computations. II. Lower bounds
scientific article

    Statements

    Treewidth computations. II. Lower bounds (English)
    0 references
    0 references
    0 references
    18 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    treewidth
    0 references
    lower bounds
    0 references
    heuristics
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references