Two-node-Hamiltonicity of enhanced pyramid networks (Q985080): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2010.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069176708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerance properties of pyramid networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant cycle-embedding in alternating group graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof that pyramid networks are 1-Hamiltonian-connected with high probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest fault-free paths in hypercubes with vertex faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian connectivity of the WK-recursive network with faulty nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-free Hamiltonian cycles in twisted cubes with conditional link faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest fault-free paths in star graphs with vertex faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-free Hamiltonian cycles in crossed cubes with conditional link faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on time-bounded bottom-up pyramid cellular acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the nearly shortest path in crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing vertex-disjoint paths in \((n, k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Movement Techniques for the Pyramid Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of Hamiltonians in pyramids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal and toroidal mesh networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Hamiltonian cycles in alternating group graphs under conditional fault model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter variability of cycles and tori / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction schemes for fault-tolerant Hamiltonian graphs / rank
 
Normal rank

Latest revision as of 01:31, 3 July 2024

scientific article
Language Label Description Also known as
English
Two-node-Hamiltonicity of enhanced pyramid networks
scientific article

    Statements

    Two-node-Hamiltonicity of enhanced pyramid networks (English)
    0 references
    0 references
    0 references
    20 July 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    enhanced pyramid networks
    0 references
    Hamiltonian cycle
    0 references
    fault-tolerant hamiltonicity
    0 references
    cycle embedding
    0 references
    interconnection networks
    0 references
    0 references