Pages that link to "Item:Q1095652"
From MaRDI portal
The following pages link to On mapping processes to processors in distributed systems (Q1095652):
Displaying 11 items.
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
- Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← 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)
- Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447) (← links)
- Parameterizing path partitions (Q6664058) (← links)
