On Embeddings in Cycles
| Autor: | Vladimír Müller, Ondrej Sýkora, Juraj Hromkovic, Imrich Vrťo |
|---|---|
| Rok vydání: | 1995 |
| Předmět: |
Discrete mathematics
Interconnection ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ComputerSystemsOrganization_PROCESSORARCHITECTURES Mathematics::Numerical Analysis Theoretical Computer Science Computer Science Applications Combinatorics Exact results Computer Science::Graphics Computational Theory and Mathematics Path (graph theory) Polygon mesh Hypercube Mathematics ComputingMethodologies_COMPUTERGRAPHICS Information Systems |
| Zdroj: | Information and Computation. 118(2):302-305 |
| ISSN: | 0890-5401 |
| DOI: | 10.1006/inco.1995.1068 |
| Popis: | We prove exact results on dilations in cycles for important parallel computer interconnection networks such as complete trees, hypercubes, and 2- and 3- dimensional meshes. Moreover, we show that trees, X -trees, n -dimensional meshes, pyramids, and trees of meshes have the same dilations both in the path and in the cycle. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect