Heuristics for the data arrangement problem on regular trees (Q498454): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Minimum Linear Arrangement Algorithm for Undirected Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal linear arrangements of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cutting a few vertices from a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear labelings and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments on the minimum linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the weight setting problem in OSPF routing / rank
 
Normal rank

Latest revision as of 19:31, 10 July 2024

scientific article
Language Label Description Also known as
English
Heuristics for the data arrangement problem on regular trees
scientific article

    Statements

    Heuristics for the data arrangement problem on regular trees (English)
    0 references
    0 references
    0 references
    28 September 2015
    0 references
    combinatorial optimisation
    0 references
    data arrangement problem
    0 references
    regular trees
    0 references
    heuristics
    0 references

    Identifiers