Embedding complete bipartite graph into grid with optimum congestion and wirelength
Year of publication: |
2017
|
---|---|
Authors: | Greeni, A. Berin ; Rajasingh, Indra |
Published in: |
International journal of networking and virtual organisations : IJNVO. - Olney, Bucks. : Inderscience Enterprises, ISSN 1470-9503, ZDB-ID 2113295-1. - Vol. 17.2017, 1, p. 64-75
|
Subject: | embedding | congestion | edge isoperimetric problem | complete bipartite graph | grid | cylinder | Graphentheorie | Graph theory | Engpass | Bottleneck | Computernetz | Computer network | Verkehrsstau | Traffic congestion |
-
Embeddings of circulant networks
Rajasingh, Indra, (2013)
-
Exact wirelength of embedding chord graph into tree-based architectures
Parthiban, N., (2017)
-
Adler, Nicole, (2022)
- More ...
-
Embeddings of circulant networks
Rajasingh, Indra, (2013)
-
Exact wirelength of embedding chord graph into tree-based architectures
Parthiban, N., (2017)
- More ...