On mapping processes to processors in distributed systems
From MaRDI portal
Publication:1095652
DOI10.1007/BF01408172zbMath0632.68029OpenAlexW2052162800MaRDI QIDQ1095652
Yaron Wolfstahl, Shlomit S. Pinter
Publication date: 1987
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01408172
Related Items
On the \(k\)-path cover problem for cacti, Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow, Differential approximation results for the traveling salesman and related problems, Path covering problems and testing of printed circuits, Parameterizing path partitions, An efficient algorithm to construct disjoint path covers of DCell networks, Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs, Optimal covering of cacti by vertex-disjoint paths, Finding a minimum path cover of a distance-hereditary graph in polynomial time, An approximation algorithm for the asymmetric travelling salesman problem with distances one and two, Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Cites Work
