2000 character limit reached
Link Identifiability with Two Monitors: Proof of Selected Theorems
Published 17 Dec 2020 in cs.NI | (2012.09972v2)
Abstract: This is a technical report, containing all the theorem proofs in paper "Link Identifiability in Communication Networks with Two Monitors" by Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, and Don Towsley, published in IEEE Globecom, 2013.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.