Distinguishing Views in Symmetric Networks: A Tight Lower Bound

Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak

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\ge D\ge 1$, there…