Decompositions of critical trees with cutwidth \(k\) (Q2326339): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127194118, #quickstatements; #temporary_batch_1721947978549
 
(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/s40314-019-0924-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2977426240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cutwidth and the Topological Bandwidth of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-cutwidth critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4924887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of \(k\)-cutwidth critical trees / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127194118 / rank
 
Normal rank

Latest revision as of 00:09, 26 July 2024

scientific article
Language Label Description Also known as
English
Decompositions of critical trees with cutwidth \(k\)
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references