Your selections:
A linear time algorithm for embedding chord graphs into certain necklace and windmill graphs
- Rajalaxmi, T. M., Parthiban, N., Ryan, Joe, Shantrinal, A. Arul, Rajan, R. Sundara
A lower bound for dilation of an embedding
- Sundara Rajan, R., Manuel, Paul, Rajasingh, Indra, Parthiban, N., Miller, Mirka
Exact wirelength of embedding chord graph into tree-based architectures
- Parthiban, N., Ryan, Joe, Rajasingh, Indra, Sundara Rajan, R., Nirmala Rani, L.
Minimum linear arrangement of incomplete hypercubes
- Miller, Mirka, Sundara Rajan, R., Parthiban, N., Rajasingh, Indra
Are you sure you would like to clear your session, including search history and login status?