Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Josep Diaz / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Gibbons / rank
Normal rank
 
Property / author
 
Property / author: Josep Diaz / rank
 
Normal rank
Property / author
 
Property / author: Alan M. Gibbons / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimum Linear Arrangement Algorithm for Undirected Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(96)00274-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086214832 / rank
 
Normal rank

Latest revision as of 09:05, 30 July 2024

scientific article
Language Label Description Also known as
English
Parallel algorithms for the minimum cut and the minimum length tree layout problems
scientific article

    Statements

    Parallel algorithms for the minimum cut and the minimum length tree layout problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 1998
    0 references
    parallel algorithms
    0 references
    minimum cut linear arrangement problems
    0 references

    Identifiers