Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Rajan, R. Sundara"'
Graph embedding is the major technique which is used to map guest graph into host graph. In architecture simulation, graph embedding is said to be one of the strongest application for the execution of parallel algorithm and simulation of various inte
Externí odkaz:
http://arxiv.org/abs/2212.12312
Publikováno v:
Fundamenta Informaticae, Volume 182, Issue 3 (November 18, 2021) fi:8351
A zero forcing set is a set $S$ of vertices of a graph $G$, called forced vertices of $G$, which are able to force the entire graph by applying the following process iteratively: At any particular instance of time, if any forced vertex has a unique u
Externí odkaz:
http://arxiv.org/abs/2108.04764
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph embedding proble
Externí odkaz:
http://arxiv.org/abs/1910.10643
Autor:
Rajan, R. Sundara, Rajalaxmi, T. M., Stephen, Sudeep, Shantrinal, A. Arul, Kumar, K. Jagadeesh
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph embedding proble
Externí odkaz:
http://arxiv.org/abs/1902.03391
A locating-dominating set (LDS) of a graph $G$ is a dominating set $S$ of $G$ such that for every two vertices $u$ and $v$ in $V(G) \setminus S$, $N(u)\cap S \neq N(v)\cap S$. The locating-domination number $\gamma^{L}(G)$ is the minimum cardinality
Externí odkaz:
http://arxiv.org/abs/1901.07735
Autor:
Rajan, R. Sundara, Shantrinal, A. Arul, Kumar, K. Jagadeesh, Rajalaxmi, T. M., Fan, Jianxi, Fan, Weibei
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the wirelength. In
Externí odkaz:
http://arxiv.org/abs/1901.07717
Autor:
Raj, R. Nithya1 nithyarajmaths@gmail.com, Rajan, R. Sundara1, Ragunathan, Thatchinamoorthi2, Pillai, N. Muthuvairavan3, Balamuralitharan, S.4
Publikováno v:
Advanced Mathematical Models & Applications. 2024, Vol. 9 Issue 1, p121-129. 9p.
Autor:
Rajan, R. Sundara1 (AUTHOR) vprsundar@gmail.com, Reji, Remi Mariam2 (AUTHOR) remimariamreji@gmail.com, Sadagopan, N.3 (AUTHOR) sadagopan@iiitdm.ac.in, Cangul, Ismail Naci4 (AUTHOR) cangul@uludag.edu.tr
Publikováno v:
Parallel Processing Letters. Oct2024, p1. 13p.
Publikováno v:
The Journal of Supercomputing, Volume 77, 4135-4150 (2021)
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential for paralle
Externí odkaz:
http://arxiv.org/abs/1807.06787
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, M\"{o}biu
Externí odkaz:
http://arxiv.org/abs/1703.01149