Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements

DOI10.1109/TC.2008.160zbMath1368.68090MaRDI QIDQ4974983

Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park

Publication date: 8 August 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2008.160

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

General-demand disjoint path covers in a graph with faulty elements, Hamiltonian properties on a class of circulant interconnection networks, Hamiltonicity of hypercubes with faulty vertices, A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs, Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest, Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults, Algorithms for finding disjoint path covers in unit interval graphs, Paired many-to-many disjoint path covers in restricted hypercube-like graphs, Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks, Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes, Paired many-to-many disjoint path covers in faulty hypercubes, The 2-path-bipanconnectivity of hypercubes, Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs, Many-to-many disjoint paths in hypercubes with faulty vertices, One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes, Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements, Strong matching preclusion, A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph, Many-to-many disjoint paths in faulty hypercubes, Paired many-to-many disjoint path covers of hypercubes with faulty edges, Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes, Complete binary trees embeddings in Möbius cubes, Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes, Ore-type degree conditions for disjoint path covers in simple graphs, Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs, Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs, A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph, One-to-one disjoint path covers in digraphs, Strong matching preclusion under the conditional fault model, Characterization of interval graphs that are unpaired 2-disjoint path coverable, Torus-like graphs and their paired many-to-many disjoint path covers, Fractional matching preclusion of the restricted HL-graphs, Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs, Many-to-many two-disjoint path covers in cylindrical and toroidal grids, Disjoint path covers with path length constraints in restricted hypercube-like graphs, Disjoint path covers joining prescribed source and sink sets in interval graphs, Many-to-many two-disjoint path covers in restricted hypercube-like graphs, Single-source three-disjoint path covers in cubes of connected graphs, Paired many-to-many disjoint path covers of the hypercubes, Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph, Disjoint path covers in cubes of connected graphs, Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses, Efficient Connectivity Testing of Hypercubic Networks with Faults