Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Paul D. Manuel / rank
Normal rank
 
Property / author
 
Property / author: Paul D. Manuel / rank
 
Normal rank
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.1016/j.dam.2010.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023955326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform emulations of Cartesian-product and Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The congestion of \(n\)-cube layout on a rectangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding ladders and caterpillars into the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding graphs in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding complete binary trees into star and Pancake graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal embeddings of generalized ladders into hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cyclic cutwidth of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete binary trees in folded and enhanced cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two results on linear embeddings of complete binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding complete graphs into hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of cycles and wheels into arbitrary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of tree embedding problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:20, 3 July 2024

scientific article
Language Label Description Also known as
English
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
scientific article

    Statements

    Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (English)
    0 references
    10 March 2011
    0 references
    fixed interconnection parallel architecture
    0 references
    folded hypercube
    0 references
    enhanced hypercube
    0 references
    augmented hypercube
    0 references
    complete binary tree
    0 references
    embedding
    0 references
    average edge congestion
    0 references
    0 references

    Identifiers