An efficient algorithm to find a double-loop network that realizes a given L-shape (Q2503285): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.tcs.2006.01.048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988529785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to find optimal double loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm to find the steps of double-loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching fault diagnosis agreement under a hybrid fault model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of weighted double loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed loop network with minimum transmission delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double commutative-step digraphs with minimum diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementary survey on double-loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double loop networks with minimum delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank
 
Normal rank

Latest revision as of 20:22, 24 June 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm to find a double-loop network that realizes a given L-shape
scientific article

    Statements

    An efficient algorithm to find a double-loop network that realizes a given L-shape (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    local area network
    0 references
    double-loop network
    0 references
    diameter
    0 references
    L-shape
    0 references
    algorithm
    0 references
    0 references