An efficient algorithm to construct disjoint path covers of DCell networks (Q897875): Difference between revisions

From MaRDI portal
Changed an 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.2015.09.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172760123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An oblivious shortest-path routing algorithm for fully connected cubic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient unicast in bijective connection networks with the restricted faulty node set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic algorithm for finding next-to-shortest paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal broadcasting for locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two spanning disjoint paths with required length in generalized hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mapping processes to processors in distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structured digraphs and program testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing gulde / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on alternating group graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on multi-dimensional tori / rank
 
Normal rank

Latest revision as of 04:46, 11 July 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm to construct disjoint path covers of DCell networks
scientific article

    Statements

    An efficient algorithm to construct disjoint path covers of DCell networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    data center network
    0 references
    DCell network
    0 references
    disjoint path cover
    0 references
    Hamiltonian path
    0 references
    0 references
    0 references

    Identifiers

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