Optimal Linear Arrangement of Turán Graphs
2020 ◽
Vol 8
(6)
◽
pp. 3618-3621
Keyword(s):
Graph embedding in parallel processing techniques has acquired considerable attention and hence raised as an efficient approach for reducing overhead data into low-dimensional space. Optimal layout and congestion are powerful parameters to examine the capability of embedding. In this study, Modified Congestion and -Partition lemmas are utilized to obtain the optimal layout of Turán graph into path and windmill graphs.
Keyword(s):
2020 ◽
Keyword(s):
Keyword(s):
Keyword(s):
2018 ◽
Vol 37
(10)
◽
pp. 1233-1252
◽