Distinguishing Views in Symmetric Networks: A Tight Lower Bound - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2015

Distinguishing Views in Symmetric Networks: A Tight Lower Bound

Abstract

The view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers $n\geq D\geq 1$, there exists a port-labeled network with at most $n$ nodes and diameter at most $D$ which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth $\Omega(D\log (n/D))$ are identical.
Fichier principal
Vignette du fichier
view.pdf (234.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00875370 , version 1 (21-10-2013)
hal-00875370 , version 2 (15-05-2014)
hal-00875370 , version 3 (08-03-2015)

Identifiers

Cite

Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak. Distinguishing Views in Symmetric Networks: A Tight Lower Bound. Theoretical Computer Science, 2015, 582, pp.27-34. ⟨10.1016/j.tcs.2015.03.018⟩. ⟨hal-00875370v3⟩
325 View
389 Download

Altmetric

Share

Gmail Facebook X LinkedIn More