A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.11.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560275761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of twisted cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on ``Independent spanning trees in crossed cubes'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for constructing independent spanning trees on parity cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four Independent Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of cycles in twisted cubes with edge-pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal fault-tolerant embedding of paths in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing edge-disjoint spanning trees in locally twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic pancyclicity of twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and cycles identifying vertices in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a family of meshes into twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of tori and grids into twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent spanning trees on twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-fault-tolerant node-pancyclicity of twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing edge-disjoint spanning trees in twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting secure messages via optimal independent spanning trees in folded hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding cycles into faulty twisted cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three tree-paths / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:30, 13 July 2024

scientific article
Language Label Description Also known as
English
A parallel algorithm for constructing independent spanning trees in twisted cubes
scientific article

    Statements

    A parallel algorithm for constructing independent spanning trees in twisted cubes (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithms
    0 references
    independent spanning trees
    0 references
    interconnection networks
    0 references
    twisted cubes
    0 references
    0 references