Paired many-to-many disjoint path covers of hypercubes with faulty edges (Q763493): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984834024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning multi-paths in hypercubes / 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: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-fault-tolerant diameter and bipanconnectivity of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths in hypercubes with a quadratic number of faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the theory of hypercube graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths in hypercubes with conditional node-faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path embedding in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-free cycles passing through prescribed paths in hypercubes with faulty edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-fault-tolerant bipanconnectivity of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank

Latest revision as of 23:22, 4 July 2024

scientific article
Language Label Description Also known as
English
Paired many-to-many disjoint path covers of hypercubes with faulty edges
scientific article

    Statements

    Paired many-to-many disjoint path covers of hypercubes with faulty edges (English)
    0 references
    0 references
    9 March 2012
    0 references
    hypercube
    0 references
    Hamiltonian path
    0 references
    vertex-disjoint paths
    0 references
    cover
    0 references
    fault tolerance
    0 references
    interconnection networks
    0 references

    Identifiers

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