The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks (Q2118871): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Hypercube and Hyperbus Structures for a Computer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two node-disjoint paths in balanced hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mobius cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bicube: an interconnection of two hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning connectivity and spanning laceability of hypercube-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault diagnosability of bicube networks under the PMC diagnostic model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipanconnectivity of bipartite hypercube-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Path Cover Problems in Digraphs and Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties on the class of hypercube-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired many-to-many disjoint path covers in restricted hypercube-like graphs / rank
 
Normal rank

Revision as of 10:10, 28 July 2024

scientific article
Language Label Description Also known as
English
The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
scientific article

    Statements

    The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks (English)
    0 references
    0 references
    0 references
    23 March 2022
    0 references
    unpaired disjoint paths
    0 references
    bipartite hypercube-like networks
    0 references
    faulty elements
    0 references

    Identifiers