Many-to-many disjoint paths in faulty hypercubes

From MaRDI portal
Publication:730958

DOI10.1016/j.ins.2009.05.006zbMath1193.68050OpenAlexW2004178113MaRDI QIDQ730958

Xie-Bin Chen

Publication date: 1 October 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.05.006




Related Items (42)

Algorithms for finding disjoint path covers in unit interval graphsPaired many-to-many disjoint path covers in restricted hypercube-like graphsEmbedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and linksDisjoint path covers with path length constraints in restricted hypercube-like graphsEdge-fault-tolerant diameter and bipanconnectivity of hypercubesMany-to-many disjoint path covers in \(k\)-ary \(n\)-cubesPaired many-to-many disjoint path covers in faulty hypercubesNote on the subgraph component polynomialPaired 2-disjoint path covers of multidimensional torus networks with faulty edgesConditional edge-fault-tolerant Hamiltonicity of dual-cubesPaired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubesA note on cycle embedding in hypercubes with faulty verticesUnpaired many-to-many disjoint path covers in restricted hypercube-like graphsDisjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elementsMany-to-many two-disjoint path covers in restricted hypercube-like graphsAn efficient construction of one-to-many node-disjoint paths in folded hypercubesSingle-source three-disjoint path covers in cubes of connected graphsPaired many-to-many disjoint path covers of the hypercubesEdge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graphDisjoint path covers in cubes of connected graphsUnnamed ItemThe 2-path-bipanconnectivity of hypercubesPaired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphsGeneral-demand disjoint path covers in a graph with faulty elementsOdd cycles embedding on folded hypercubes with conditional faulty edgesMany-to-many disjoint paths in hypercubes with faulty verticesIndependent spanning trees on even networksThe triangular pyramid: Routing and topological propertiesConditional edge-fault Hamiltonicity of augmented cubesPancyclicity and bipancyclicity of conditional faulty folded hypercubesUnpaired many-to-many vertex-disjoint path covers of a class of bipartite graphsThe spanning connectivity of folded hypercubesHamiltonian paths in hypercubes with local trapsMaximally local connectivity and connected components of augmented cubesA linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graphHamiltonicity of hypercubes with faulty verticesPaired many-to-many disjoint path covers of hypercubes with faulty edgesTwo conditions for reducing the maximal length of node-disjoint paths in hypercubesMany-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubesVertex-disjoint paths joining adjacent vertices in faulty hypercubesMany-to-many two-disjoint path covers in cylindrical and toroidal gridsThe unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks



Cites Work


This page was built for publication: Many-to-many disjoint paths in faulty hypercubes