CENTROIDAL DIMENSION
Let B={w_1,w_2,…,w_k}⊆V(G) be a set of vertices, and x be any vertex in G. We denote r(x) as an ordered partition of B, that is a list of subsets of B in non-decreasing order by their distance from x. Vertex set B is called a centroidal locating set of G if r(x)≠r(y) for every...
Saved in:
Main Author: | TAMARO NADAEK (NIM:20116027), CHRISTYAN |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/26276 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
CENTROIDAL DIMENSION
by: Tamaro Nadeak, Christyan -
Anisotropic centroidal voronoi tessellations and their applications
by: Wang, Desheng, et al.
Published: (2009) -
Speaker verification with adaptive spectral subband centroids
by: Kinnunen, T., et al.
Published: (2013) -
Computing Centroidal Voronoi Tessellation Using the GPU
by: Zheng, J, et al.
Published: (2022) -
Intrinsic computation of Centroidal Voronoi Tessellation (CVT) on meshes
by: Wang, Xiaoning, et al.
Published: (2018)