Paired many-to-many disjoint path covers in restricted hypercube-like graphs

DOI10.1016/J.TCS.2016.04.007zbMATH Open1339.68211OpenAlexW4200017195MaRDI QIDQ284574FDOQ284574

Authors Jung-Heum Park 

Publication date 18 May 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.04.007

zbMATH Keywords

disjoint pathfault toleranceinterconnection networkpath coverpath partitionhypercube-like graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers in faulty hypercubes
• Torus-like graphs and their paired many-to-many disjoint path covers

Cites work

• scientific article; zbMATH DE number 53191 (Why is no real title available?)
• Disjoint path covers in cubes of connected graphs
• Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
• General-demand disjoint path covers in a graph with faulty elements
• Graph theory
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Many-to-many disjoint paths in faulty hypercubes
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• On Path Cover Problems in Digraphs and Applications to Program Testing
• On the generalized twisted cube
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• One-to-one disjoint path covers on alternating group graphs
• One-to-one disjoint path covers on multi-dimensional tori
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers of the hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• Recursive circulants and their embeddings among hypercubes
• Single-source three-disjoint path covers in cubes of connected graphs
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• The two-equal-disjoint path cover problem of matching composition network
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

Cited in

(16)

• Constructing completely independent spanning trees in crossed cubes
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• The two-equal-disjoint path cover problem of matching composition network
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
• Algorithms and Computation
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Torus-like graphs and their paired many-to-many disjoint path covers
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• Paired many-to-many disjoint path covers in faulty hypercubes

This page was built for publication: Paired many-to-many disjoint path covers in restricted hypercube-like graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284574)