Thumbnail
Access Restriction
Open

Author Dereniowski, Dariusz ♦ Kosowski, Adrian ♦ Pająk, Dominik
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Symmetric Network ♦ Tight Lower Bound ♦ Port-labeled Network ♦ Infinite Tree
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 ≥ D ≥ 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 Ω(D log(n/D)) are identical.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2013-01-01