Header menu link for other important links
Embedding complete bipartite graphs into necklace graphs
Published in Elsevier B.V.
Volume: 172
Pages: 199 - 203
Graph embedding is an important technique used in studying the problem of efficiently implementing parallel algorithms on parallel computers. Wirelength is an embedding parameter widely studied in data structures and data representations, electrical networks, VLSI network and chemical graphs. This parameter had been studied for embedding complete bipartite graphs into complete necklace, star necklace and windmill graphs. © 2020 The Authors. Published by Elsevier B.V.
About the journal
JournalData powered by TypesetProcedia Computer Science
PublisherData powered by TypesetElsevier B.V.