@misc{Harutyunyan_A.G._Coarse-Grained,
 author={Harutyunyan, A.G. and Khachatryan, R. N.},
 address={Երևան},
 howpublished={online},
 publisher={«Պոլիտեխնիկ» տպ.},
 abstract={The spanning graph construction problem is to create a sparse graph over a given set of points so that the graph contains at least one minimum spanning tree under a specified distance metric. This problem is the basis for many algorithms like rectilinear minimum spanning tree construction, efficient Steiner tree construction, obstacle aware Steiner tree construction, etc. These algorithms are used in many fields of computer science, especially in VLSI routing. As many of these algorithms are NP-complete problems and some of them use the spanning graph construction approach, parallelization of the spanning graph construction algorithm will optimize other problems as well. In this paper, we present the coarse-grained parallelization approach of the spanning graph construction algorithm. The proposed algorithm, compared to the existing sequential algorithm, achieves an average performance improvement of about 40-60% and keeps the correctness of the original algorithm.},
 title={Coarse-Grained Parallelization Of The Spanning Graph Construction Algorithm},
 type={Հոդված},
 keywords={Automataion And Control Systems},
}