Weighted Treewidth Algorithmic Techniques and Results (Q5387824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Experimental and Efficient Algorithms / 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: Weighted Treewidth Algorithmic Techniques and Results / 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: Q4414495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe reduction rules for weighted treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Number of Obstructions to Treewidth / rank
 
Normal rank

Latest revision as of 09:55, 28 June 2024

scientific article; zbMATH DE number 5279508
Language Label Description Also known as
English
Weighted Treewidth Algorithmic Techniques and Results
scientific article; zbMATH DE number 5279508

    Statements

    Identifiers