◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. M. Rajalaxmi

3 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author2
  • last author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.CO3

identity via Semantic Scholar / OpenAlex

most citedEmbedding complete multi-partite graphs into Cartesian product of paths and cycles

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2019

Embedding onto Wheel-like Networks

R. Sundara Rajan, T. M. Rajalaxmi, Sudeep Stephen +2

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 simulatio…

math.CO2019★ 2 cited

Embedding complete multi-partite graphs into Cartesian product of paths and cycles

R. Sundara Rajan, A. Arul Shantrinal, K. Jagadeesh Kumar +3

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 parame…

math.CO2018

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

R. Sundara Rajan, Thomas Kalinowski, Sandi Klavžar +2

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.