Pages that link to "Item:Q4132557"
From MaRDI portal
The following pages link to Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization (Q4132557):
Displaying 23 items.
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- Chain packing in graphs (Q808291) (← links)
- On mapping processes to processors in distributed systems (Q1095652) (← links)
- Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
- On the tree packing problem (Q1183337) (← links)
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855) (← links)
- Minimum node disjoint path covering for circular-arc graphs (Q1257337) (← links)
- Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section (Q2034833) (← links)
- Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures (Q2038934) (← links)
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs (Q2184362) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← 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)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- Colinear Coloring on Graphs (Q3605491) (← links)
- Path node-covering constants for certain families of trees (Q4177593) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447) (← links)
- GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY (Q5470171) (← links)
