Disjoint path covers in recursive circulants G(2m,4) with faulty elements (original) (raw)
Related papers
Paired Many-to-Many Disjoint Path Covers in Recursive Circulants (G(2m,4))(G(2^m,4))(G(2m,4))
IEEE Transactions on Computers, 2013
General-demand disjoint path covers in a graph with faulty elements
International Journal of Computer Mathematics, 2012
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2014
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2016
Paired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2016
Operations Research Letters, 2007
Disjoint path covers with path length constraints in restricted hypercube-like graphs
Journal of Computer and System Sciences, 2017
Torus-like graphs and their paired many-to-many disjoint path covers
Discrete Applied Mathematics, 2021
One-to-many node-disjoint paths in (n, k)-star graphs
Discrete Applied Mathematics, 2010
Ore-type degree conditions for disjoint path covers in simple graphs
Discrete Mathematics, 2016
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science, 2013
Disjoint non-balanced A-paths in biased graphs
Advances in Applied Mathematics, 2020
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs
The Journal of Supercomputing
Note on the problem of partially link disjoint paths
Characterization of interval graphs that are unpaired 2-disjoint path coverable
Theoretical Computer Science, 2020
Optimal Construction of Edge-Disjoint Paths in Random Graphs
SIAM Journal on Computing, 1998
Disjoint path covers in cubes of connected graphs
Discrete Mathematics, 2014
Discrete Mathematics, 2011
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
Journal of Computing and Information Technology
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Discrete Applied Mathematics, 2017
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
Combinatorica, 2014
Disjoint paths of bounded length in large generalized cycles.
Deterministic Replacement Path Covering
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021
Information Sciences, 2013
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM, 1978
On the -path vertex cover of some graph products
Discrete Mathematics, 2013
Single-source three-disjoint path covers in cubes of connected graphs
Information Processing Letters, 2013
Edge-disjoint paths in planar graphs
Journal of Combinatorial Theory, Series B, 1985
A disjoint path problem in the alternating group graph
Revisiting path-type covering and partitioning problems
arXiv: Combinatorics, 2018
A linear-time algorithm for thek-fixed-endpoint path cover problem on cographs
Networks, 2007
# a 35 Integers 15 ( 2015 ) Graph Compositions : Deleting Edges from Complete Graphs
2015
Optimal covering of cacti by vertex-disjoint paths
Theoretical Computer Science, 1991
Covering partially directed graphs with directed paths
Discrete Mathematics, 2006