A general method for efficient embeddings of graphs into optimal hypercubes

Volker Heun, Ernst W. Mayr

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

2 Zitate (Scopus)

Abstract

Embeddings of several graph classes into hypercubes have been widely studied. Unfortunately, almost all investigated graph classes are regular graphs such as meshes, complete trees, pyramids. In this paper, we present a general method for one-to-one embedding irregular graphs into their optimal hypercubes based on extended-edge-bisectors of graphs. An extended-edge-bisector is an edge-bisector with the additional property that a subset of the vertices is distributed more or less evenly among the two halves of the bisected graph. The dilation and congestion of the embedding depends on the quality of the extended-edge-bisector. Moreover, if the extended bisection can be efficiently computed on the hypercube, so can the embedding.

OriginalspracheEnglisch
TitelEuro-Par 1996 Parallel Processing - 2nd International Euro-Par Conference, Proceedings
Redakteure/-innenLuc Bouge, Pierre Fraigniaud, Anne Mignotte, Yves Robert, Luc Bouge, Pierre Fraigniaud, Anne Mignotte, Yves Robert
Herausgeber (Verlag)Springer Verlag
Seiten222-233
Seitenumfang12
ISBN (Print)9783540616269, 9783540616269
DOIs
PublikationsstatusVeröffentlicht - 1996
Veranstaltung2nd International European Conference on Parallel Processing, Euro-Par 1996 - Lyon, Frankreich
Dauer: 26 Aug. 199629 Aug. 1996

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band1123
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz2nd International European Conference on Parallel Processing, Euro-Par 1996
Land/GebietFrankreich
OrtLyon
Zeitraum26/08/9629/08/96

Fingerprint

Untersuchen Sie die Forschungsthemen von „A general method for efficient embeddings of graphs into optimal hypercubes“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren