Geodesic
Minimum Linear Arrangement of Generalized Sierpinski Graphs
Journal of Graph Algorithms and Applications, Tome 27 (2023) no. 9, pp. 767-782.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

The creation of scientific supercomputers is one of the most pressing issues confronting technology today. Experts in computer science anticipate that future supercomputers will be built on large-scale parallel processing. A system with multiple processors and memories will be used in such a computer. The interconnection network that allows communication between the system’s processors and memories is a critical component of such systems. In the topic of interconnection networks for parallel computer architectures, graph embedding problems have grown in relevance. Network embedding has been recognized as a valuable method for developing efficient algorithms and simulating various architectures in parallel and distributed computing. In this paper, we obtain the maximum subgraph of the generalized Sierpinski graphs $S(n, m), n\geq 2, m\geq 3$, and calculate the minimum linear arrangement of generalized Sierpinski graphs by graph embeddings. 
@article{JGAA_2023_27_9_a1,
     author = {Sundara Rajan R and Berin Greeni A and Leo Joshwa P},
     title = {Minimum {Linear} {Arrangement} of {Generalized} {Sierpinski} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {767--782},
     publisher = {mathdoc},
     volume = {27},
     number = {9},
     year = {2023},
     doi = {10.7155/jgaa.00644},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00644/}
}
TY  - JOUR
AU  - Sundara Rajan R
AU  - Berin Greeni A
AU  - Leo Joshwa P
TI  - Minimum Linear Arrangement of Generalized Sierpinski Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2023
SP  - 767
EP  - 782
VL  - 27
IS  - 9
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00644/
DO  - 10.7155/jgaa.00644
LA  - en
ID  - JGAA_2023_27_9_a1
ER  - 
%0 Journal Article
%A Sundara Rajan R
%A Berin Greeni A
%A Leo Joshwa P
%T Minimum Linear Arrangement of Generalized Sierpinski Graphs
%J Journal of Graph Algorithms and Applications
%D 2023
%P 767-782
%V 27
%N 9
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00644/
%R 10.7155/jgaa.00644
%G en
%F JGAA_2023_27_9_a1
Sundara Rajan R; Berin Greeni A; Leo Joshwa P. Minimum Linear Arrangement of Generalized Sierpinski Graphs. Journal of Graph Algorithms and Applications, Tome 27 (2023) no. 9, pp. 767-782. doi : 10.7155/jgaa.00644. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00644/

Cité par Sources :