- Full text PDF available (4)
25 The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-walks in graphs. We
The significance of prolonged retention of barium in the appendix in an asymptomatic patient has been debated. Four patients, with retained barium in the appendix for several months after gastrointestinal barium studies, who then developed acute appendicitis, are reported and analyzed. Thirty-one patients who retained appendiceal barium longer than 72 hr… (More)
Explicit formulae for the γ-min and γ-max labeling values of complete bipartite graphs are given, along with γ-labelings which achieve these extremes. A recursive formula for the γ-min labeling value of any complete multipartite is also presented.
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-walks in graphs. We search for a shortest closed route visiting k cities in a non complete graph without weights. This motivates the following definition. Given a set of k distinct… (More)
Aharoni, Milner and Prikry introduced the " Prisoners and Guards " game as a two-player game on an n × n checkerboard. At the beginning of the game, every square of the board has a guard. At each stage in the game, for each prisoner, there must be at least as many guards as prisoners on adjacent squares. The players take turns either replacing a guard with… (More)