Trimming weighted graphs of bounded treewidth (Q415289): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.07.023 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963539025 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.07.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963539025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimming of Graphs, with Application to Point Labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank

Latest revision as of 05:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Trimming weighted graphs of bounded treewidth
scientific article

    Statements

    Trimming weighted graphs of bounded treewidth (English)
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    treewidth
    0 references
    graph trimming
    0 references
    map labelling
    0 references
    0 references