( en | de | ru )

 

Disambiguation of "Rajalaxmi, T. M."

Author of the publication

copydeleteadd this publication to your clipboard
Maximum incomplete recursive circulants in graph embeddings.

, , , , and . Discret. Math. Algorithms Appl., 7 (4): 1550053:1-1550053:22 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

M t cet a

W M T Harshi Weerasinghe

Sven M B T Wolter

T Peters

T Frieberg

 

Other publications of authors with the same name

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength., , , and . J. Graph Algorithms Appl., 25 (1): 367-381 (2021)Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes., , , , and . CoRR, (2018)Embedding of Recursive Circulants into Certain Necklace Graphs., , and . Math. Comput. Sci., 9 (2): 253-263 (2015)A linear time algorithm for embedding hypercube into cylinder and torus., , , and . Theor. Comput. Sci., (2014)Hierarchical Fuzzy Hidden Markov Chain for Web Applications., and . Int. J. Inf. Technol. Decis. Mak., 15 (1): 83-118 (2016)Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout., , , and . CoRR, (2022)Wiener index via wirelength of an embedding., , , , , and . Discret. Math. Algorithms Appl., 14 (1): 2150087:1-2150087:19 (2022)Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength., , and . CALDAM, volume 13947 of Lecture Notes in Computer Science, page 403-414. Springer, (2023)Embedding Circulant Networks into Butterfly and Benes Networks., , , , and . IWOCA, volume 8986 of Lecture Notes in Computer Science, page 298-306. Springer, (2014)Deep Learning for People Counting Model., and . SocProS (1), volume 1048 of Advances in Intelligent Systems and Computing, page 531-538. Springer, (2018)