Understanding Hidden Knowledge in Generic Graphs

When the edge between two nodes is not measured, is there any hint to know the edge property, and will the inferred edge property be useful? To answer these questions, this paper uniformly defines the properties of unmeasurable edges in generic graphs. For an unmeasurable edge (i,j) , it is called...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE/ACM transactions on networking 2024-06, Vol.32 (3), p.2631-2645
Hauptverfasser:	Ping, Haodi, Wang, Yongcai, Zhang, Yu, Li, Deying, Xie, Lihua
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Distance measurement Generic graph Graphs Image edge detection Inference algorithms Internet of Things Location awareness node localizability rangeable rigid Rigidity Sufficient conditions unmeasurable edge
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!