the purpose of this study was to investigate the mediating role of learning goal orientation at the individual, group and organizational level in the relationship of transformational leadership with adaptive performance. the sample consisted of 175 employees of a service organization. fitness of the proposed model and indirect effects was examined through structural equation modeling and bootst...

The graph orientation problem calls for orienting the edges of an undirected graph so as to maximize the number of pre-specified source-target vertex pairs that admit a directed path from the source to the target. Most algorithmic approaches to this problem share a common preprocessing step, in which the input graph is reduced to a tree by repeatedly contracting its cycles. While this reduction...

A conjecture of Merino and Welsh says that the number of spanning trees τ(G) of a loopless and bridgeless multigraph G is always less than or equal to either the number a(G) of acyclic orientations, or the number c(G) of totally cyclic orientations, that is, orientations in which every edge is in a directed cycle. We prove that τ(G) ≤ c(G) if G has at least 4n edges, and that τ(G) ≤ a(G) if G h...

Background and Objective: This study was aimed to evaluate the collagen fibers qualitatively and its correlation with microvascular density in various grades of oral submucous fibrosis (OSMF).   Material and Methods: The present study comprised of total 40 cases of oral submucous fibrosis. Picrosirius red staining was done on all the specimens’ sections. ...

We present the rst randomized O(log n) time and O(m+n) work EREW PRAM algorithm for nding a spanning forest of an undirected graph G = (V; E) with n vertices and m edges. Our algorithm is optimal with respect to time, work and space. As a consequence we get optimal randomized EREW PRAM algorithms for other basic connectivity problems such as nding a bipartite partition, nding bridges and biconn...

Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent blowing up the maximum out-degree. We use arboricity as our sparsity measure. With an immensely simple greedy algorithm, we get parametrized trade-off bounds between outdegree and...

Background: Psychological stress is associated with unhealthy lifestyles, including smoking. Moreover, religiousbeliefs can play a significant role in relieving mental disorders such as anxiety and stress. Due to the frequentexposure of medical students to stressful situations, this study was conducted with the aim to investigate the<sp...