Characterization of the Congestion Lemma on Layout Computation
An embedding of a guest network GN into a host network HN is to find a suitable bijective function between the vertices of the guest and the host such that each link of GN is stretched to a path in HN. The layout measure is attained by counting the length of paths in HN corresponding to the links in...
Guardado en:
Autores principales: | Jia-Bao Liu, Arul Jeya Shalini, Micheal Arockiaraj, J. Nancy Delaila |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Hindawi Limited
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/12fe8b2e16f644a581f9346d661dca59 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Schanuel's Lemma in P-Poor Modules
por: Iqbal Maulana
Publicado: (2019) -
On Computation Degree-Based Topological Descriptors for Planar Octahedron Networks
por: Wang Zhen, et al.
Publicado: (2021) -
On Computation of Edge Degree-Based Banhatti Indices of a Certain Molecular Network
por: Jiang-Hua Tang, et al.
Publicado: (2021) -
A generalized Schwarz lemma for two domains related to μ-synthesis
por: Pal Sourav, et al.
Publicado: (2018) -
Two Classes of Infrasoft Separation Axioms
por: Tareq M. Al-shami, et al.
Publicado: (2021)