The purpose of this paper is to ascertain the dynamic impacts of domestic savings and domestic investment on economic growth of Pakistan by using annual data spanning from 1973 to 2018. After being confirmed that all the variables are stationary at first difference and have long-run cointegrating association, this study employed Dynamic Ordinary Least Squares (DOLS) approach to estimate long-run elasticities. The empirical findings reveal that domestic savings are negatively and domestic investment is positively associated with economic growth in Pakistan. In a nutshell, the results convey that domestic savings are dampening the economic growth figures and domestic investment is contributing to economic growth figures of Pakistan. The results of causality analyses report bidirectional causal link between domestic savings and economic growth and a unidirectional causal association between economic growth and domestic investment. Based on these empirical findings some policies are recommended to accelerate economic growth and for the long term sustainability of economic growth in Pakistan. Contribution/Originality:This study is one of very few studies which have investigated how the economic growth of Pakistan has been influenced by domestic savings and domestic investment between the period 1973-2018. The study found that domestic savings negatively and domestic investment positively affected economic growth of Pakistan during that period.

No abstract

We propose a scheme for generating a weakly chordal graph from a randomly generated input graph, G = (V, E). We reduce G to a chordal graph H by adding fill-edges, using the minimum vertex degree heuristic. Since H is necessarily a weakly chordal graph, we use an algorithm for deleting edges from a weakly chordal graph that preserves the weak chordality property of H. The edges that are candidates for deletion are the fill-edges that were inserted into G. In order to delete a maximal number of fill-edges, we maintain these in a queue. A fill-edge is removed from the front of the queue, which we then try to delete from H. If this violates the weak chordality property of H, we reinsert this edge at the back of the queue. This loop continues till no more fill-edges can be removed from H. Operationally, we implement this by defining a deletion round as one in which the edge at the back of the queue is at the front. We stop when the size of the queue does not change over two successive deletion rounds and output H.

We propose a scheme for generating a weakly chordal graph on n vertices with m edges. In this method, we first construct a tree and then generate an orthogonal layout (which is a weakly chordal graph on the n vertices) based on this tree. In the next and final step, we insert additional edges to give us a weakly chordal graph on m edges. Our algorithm ensures that the graph remains weakly chordal after each edge is inserted. The time complesity of an insertion query is O(n 3 ) time and an insertion takes constant time. On the other hand, a generation algorithm based on finding a 2-pair takes O(nm) time using the algorithm of Arikati and Rangan [1].

No abstract