In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a proper interval graph G and a particular set T of k vertices, the goal is to compute a path cover of G with minimum cardinality, such that the vertices of T are endpoints of these paths. We propose an optimal algorithm for this problem with ru...

Abstract— Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called “critical path scheduling with t-level” (CPST) for grid computing system is proposed. There are no. of scheduling algorithms such as HEFT [1] use mean execution time based b-level for task priority and SHCP [2] use task priority based on simple critical path...

We present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to derive some known results about biased Maker-Breaker games. In particular, we show that for b = Θ( n lnn), playing a (1 : b) game on E(Kn), Maker can build a graph which contains copies of all spanning trees having ma...

Hydroforming process is largely used for the production of tubular parts in various industries, and has advantages such as less weight, higher quality, more strength and fewer production cost compared to the conventional methods of production. The aim of this study is forming a tube-shaped part with a special geometry that has both bulge- and T-zones with tube hydroforming process. The forming ...

Let N = (V, E, c, /) be a network, where G = (V, E), (VI = n and (El = m, is a directed graph, c(e) > 0 is the capacity and I(e) 2 0 is the lead time for each edge e E E. The transmission time to send u units of data from a given source s to a destination t using path p is T(a,p) = I(p) + &, where 1(p) is the sum of the lead times of the edges in p, and c(p) is the minimum capacity of the edges...

Preliminaries. A graph database G is a finite, directed, edge-labeled, multigraph defined by G = 〈N,Σ,E〉, where N is a finite set of nodes (vertices), Σ is a set of labels, E is a set of directed, labeled edges, and E ⊆ N ×Σ×N . A path p in G is defined as a sequence of n0a0n1 · · · nk−1ak−1nk where ni ∈ N , ai ∈ Σ, and 〈ni, ai, ni+1〉 ∈ E for 0 ≤ i ≤ k. We call the sequence of edge labels Σ∗ of...

In the field of spatial reasoning, point-to-point relations have been thoroughly examined, but only l i t t le attention has been payed to the modeling of path relations. We propose a computational model that extends the existing referential semantics for point-to-point relations to path relations. On the linguistic side, we present some research on German path prepositions as well as results o...

We consider searching problems in robotics that a robot has to nd a path to a target by traveling in an unknown star-shaped polygon P. The goal is to minimize the ratio of the distance traveled by the robot to the length of the shortest start-to-target path. Let s be a starting point in P. We rst present a competitive strategy to nd a path from s to the closest kernel point k of P. The length o...

background: nickel–titanium (niti) rotary instrumentation carries a risk of fracture, mainly as a result of fl exural (fatigue fracture) and torsional (shear failure) stresses. this risk might be reduced by creating a glide path before niti rotary instrumentation. the aim of this study was to compare various root canal parameters with the new waveone single-fi le reciprocating system in mesial ...