207 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR2 papers
- Sri Sivasubramaniya Nadar College of EngineeringIN2 papers
- Tech Mahindra (India)IN2 papers
- Advisory Board Company (United States)US1 paper
- Al-Farabi Kazakh National UniversityKZ1 paper
- Almaty Technological UniversityKZ1 paper
- Anna University, ChennaiIN1 paper
- ASA CollegeUS1 paper
- Broadcom (Israel)IL1 paper
- ETH ZurichCH1 paper
- Indian Institute of Technology MadrasIN1 paper
- Institute of Electrical and Electronics EngineersUS1 paper
Showing math.COShow all
2 papers · 1 filter
math.CO2021
Edge Forcing in Butterfly Networks
Jessy Sujana G., T. M. Rajalaxmi, Indra Rajasingh +1
A zero forcing set is a set of vertices of a graph , called forced vertices of , which are able to force the entire graph by applying the following process iteratively: A…
math.CO2018★ 13 cited
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…