Pages that link to "Item:Q4199539"
From MaRDI portal
The following pages link to On Path Cover Problems in Digraphs and Applications to Program Testing (Q4199539):
Displaying 35 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
- How to guard a graph? (Q652526) (← links)
- On legal path problems in digraphs (Q790621) (← links)
- On the computational complexity of path cover problems (Q799105) (← links)
- Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
- Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- Minimal controllability of conjunctive Boolean networks is NP-complete (Q1642199) (← links)
- One-to-one disjoint path covers in digraphs (Q1694726) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks (Q2118871) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
- Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs (Q2316931) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
- Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Degree sequence conditions for a graph to be disjoint path coverable (Q2696615) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
- Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest (Q6114850) (← links)
- Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)
