Constructing the nearly shortest path in crossed cubes (Q2390375): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4365373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-pancyclicity and edge-pancyclicity of crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete path embeddings in crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-pancyclicity and path-embeddability of bijective connection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected, locally 2-connected,K1,3-free graphs are panconnected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding binary trees into crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply-twisted hypercube with five or more dimensions is not vertex-transitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The <i>k</i>th Best Route Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnectivity of locally connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in Möbius cubes and crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the double-vertex-cycle-connectivity of crossed cubes / rank
 
Normal rank

Latest revision as of 20:07, 1 July 2024

scientific article
Language Label Description Also known as
English
Constructing the nearly shortest path in crossed cubes
scientific article

    Statements

    Constructing the nearly shortest path in crossed cubes (English)
    0 references
    0 references
    0 references
    22 July 2009
    0 references
    0 references
    interconnection networks
    0 references
    crossed cubes
    0 references
    nearly shortest path
    0 references
    second shortest path
    0 references
    path embedding
    0 references
    0 references