General-demand disjoint path covers in a graph with faulty elements (original) (raw)
Related papers
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs
The Journal of Supercomputing
Characterization of interval graphs that are unpaired 2-disjoint path coverable
Theoretical Computer Science, 2020
Disjoint path covers with path length constraints in restricted hypercube-like graphs
Journal of Computer and System Sciences, 2017
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
Computing Research Repository - CORR, 2008
Ore-type degree conditions for disjoint path covers in simple graphs
Discrete Mathematics, 2016
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2014
Operations Research Letters, 2007
A polynomial solution to the -fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science, 2010
A polynomial solution to the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll">mml:mik-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science, 2010
Paired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2016
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
Theoretical Computer Science, 2016
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
Algorithmica, 2009
Disjoint path covers in cubes of connected graphs
Discrete Mathematics, 2014
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Theory of Computing Systems, 2020
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science, 2011
Revisiting path-type covering and partitioning problems
arXiv: Combinatorics, 2018
Disjoint non-balanced A-paths in biased graphs
Advances in Applied Mathematics, 2020
Finding disjoint paths with different path‐costs: Complexity and algorithms
Networks, 1992
ACM Transactions on Algorithms, 2007
Assistance and Interdiction Problems on Interval Graphs
2021
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science, 2013
Note on the problem of partially link disjoint paths
A disjoint path problem in the alternating group graph
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM, 1978
The Steiner cycle and path cover problem on interval graphs
2021
Hardness of the undirected edge-disjoint paths problem
2005
A linear-time algorithm for thek-fixed-endpoint path cover problem on cographs
Networks, 2007
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Discrete Applied Mathematics, 2017
Torus-like graphs and their paired many-to-many disjoint path covers
Discrete Applied Mathematics, 2021
Improved approximation algorithms for computing k$$ k disjoint paths subject to two constraints
Journal of Combinatorial Optimization, 2013
Optimal Construction of Edge-Disjoint Paths in Random Graphs
SIAM Journal on Computing, 1998
A linear programming formulation of Mader's edge-disjoint paths problem
Journal of Combinatorial Theory, Series B, 2006
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing, 1996
Edge-disjoint paths in planar graphs
Journal of Combinatorial Theory, Series B, 1985
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