In communication networks, network coding allows intermediate nodes to combine messages, achieving transmission rates unattainable by routing alone in many multicast settings. In multiple unicast, where each source sends a message only to its prescribed destination, a central question is under what conditions fractiona...
Under the external-memory model specified in this paper, the deterministic sorting algorithm formally verified the algorithm's correctness and I/O complexity bound in Lean~4.0 is formally verified.
Network coding lets the nodes of a network combine messages rather than merely forward them. In undirected networks, where the two directions of an edge share its capacity, Li and Li conjectured in 2004 that coding offers no advantage over fractional routing; the conjecture has been confirmed for many special classes b...
A new proof that the multiple-unicast conjecture holds for networks with at most six coding nodes, without computer-aided search, is given, and it is shown that if the conjecture holds on $\Gamma_{3,3}$, then it holds whenever no three sessions have six distinct terminal locations.
Sirui Liu, Linfeng Que, Zongpeng Li et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.