On Path Cover Problems in Digraphs and Applications to Program Testing
From MaRDI portal
Cited in
(52)- Vertex covering by paths on trees with its applications in machine translation
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
- Minimal controllability of conjunctive Boolean networks is NP-complete
- One-to-one disjoint path covers in digraphs
- Clearing directed subgraphs by mobile agents. Variations on covering with paths
- Path covering problems and testing of printed circuits
- The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
- Characterization of interval graphs that are unpaired 2-disjoint path coverable
- Torus-like graphs and their paired many-to-many disjoint path covers
- 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
- Path covering number and \(L(2,1)\)-labeling number of graphs
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Algorithms for finding disjoint path covers in unit interval graphs
- Degree sequence conditions for a graph to be disjoint path coverable
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- One-to-one disjoint path covers on alternating group graphs
- On characterizing radio k-coloring problem by path covering problem
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
- Parameterizing path partitions
- Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest
- Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
- One-to-one disjoint path covers on k-ary n-cubes
- How to guard a graph?
- Distance-based covering problems for graphs of given cyclomatic number
- Parameterizing path partitions
- Degree conditions for disjoint path covers in graphs
- On a variant of the minimum path cover problem in acyclic digraphs: computational complexity results and exact method
- Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth
- Distance-based (and path-based) covering problems for graphs of given cyclomatic number
- On the unit interval graphs which are paired k-disjoint path coverable
- 2-edge Hamiltonian connectedness: characterization and results in data center networks
- Degree conditions for disjoint path covers in digraphs
- Algorithms and complexity for path covers of temporal DAGs
- On sufficient degree conditions for a graph to be disjoint path coverable
- A robust optimization approach to flow decomposition
- Isometric and induced path partitions: a new upper bound and a characterization of some extremal graphs
- Controllability backbone in multiagent networks
- Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
- Insight into controllability of complex networks through augmenting trail
- On legal path problems in digraphs
- On the computational complexity of path cover problems
- Ore-type degree conditions for disjoint path covers in simple graphs
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
This page was built for publication: On Path Cover Problems in Digraphs and Applications to Program Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199539)
