Work

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

Year: 2020

Type: article

Source: The Journal of Supercomputing

DOI: 10.1007/s11227-020-03420-w

Authors: R. Sundara Rajan, Thomas Kalinowski, Sandi Klavžar, Hamid Mokhtar, T. M. Rajalaxmi

Institutions: Hindustan Institute of Technology and Science, University of New England, University of Ljubljana, University of Maribor, Institute of Mathematics, Physics, and Mechanics, Sri Sivasubramaniya Nadar College of Engineering

Language: English

Topic: Interconnection Networks and Systems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Javna Agencija za Raziskovalno Dejavnost RS, National Board for Higher Mathematics

Awards: G1953697718, Graph theory

OpenAlex ID: W2883881826

FWCI: 0.586

Cites: 47

Cited by: 13

Related to: