Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses (Q2700790): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2023.113855 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2023.113855 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4361228740 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q121864480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The super connectivity of folded crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Escaping a grid by edge-disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced subgraphs of the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extraconnectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-fault tolerance of hypercube-like networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint paths in faulty augmented cubes / 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: Torus-like graphs and their paired many-to-many disjoint path covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint paths in hypercubes and folded hypercubes with conditional faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient routing in all-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extra connectivity of the enhanced hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability measure of multiprocessor system based on enhanced hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super connectivity of balanced hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional connectivity of star graph networks under embedding restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2023.113855 / rank
 
Normal rank

Latest revision as of 20:48, 19 December 2024

scientific article
Language Label Description Also known as
English
Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses
scientific article

    Statements

    Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses (English)
    0 references
    0 references
    27 April 2023
    0 references
    \((n,k)\)-enhanced hypercube
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers