Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ (Q4288206): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W37864402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / 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: On embeddings in cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Placement of the processors of a hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477932 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:47, 22 May 2024

scientific article; zbMATH DE number 554299
Language Label Description Also known as
English
Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$
scientific article; zbMATH DE number 554299

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references