Memetic algorithm for the antibandwidth maximization problem (Q623314): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Obnoxious Center Problem on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth of Complete k-Ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth and Cyclic Antibandwidth of Hamming Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian powers in threshold and arborescent comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of Hamiltonian paths in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Variants of the Bandwidth Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth and cyclic antibandwidth of meshes and hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth of Three-Dimensional Meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On explicit formulas for bandwidth and antibandwidth of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439289 / rank
 
Normal rank

Latest revision as of 18:06, 3 July 2024

scientific article
Language Label Description Also known as
English
Memetic algorithm for the antibandwidth maximization problem
scientific article

    Statements

    Identifiers

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