易于交谈
发表于 2025-3-26 21:13:30
Models and Techniques for Communication in Dynamic Networksng bandwidth or topology. Situations in which dynamic networks occur are, for example: faulty networks (links go up and down), the Internet (the bandwidth of connections may vary), and wireless networks (mobile units move around). We investigate the problem of how to ensure connectivity, how to rout
耐寒
发表于 2025-3-27 03:19:36
http://reply.papertrans.cn/87/8604/860325/860325_32.png
噱头
发表于 2025-3-27 09:19:53
A Space Lower Bound for Routing in Trees on the space complexity for routing messages along shortest paths in trees. It was recently shown that the family of .-node trees supports routing schemes using addresses and routing tables of size .(log../log log .) bits per node, if the output port numbers of each node are chosen by an adversary.
Interferons
发表于 2025-3-27 09:46:19
http://reply.papertrans.cn/87/8604/860325/860325_34.png
横条
发表于 2025-3-27 14:06:14
http://reply.papertrans.cn/87/8604/860325/860325_35.png
aesthetician
发表于 2025-3-27 18:05:04
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Schedulino approximation algorithms with the same ratio for fractional weighted graph coloring and preemptive resource constrained scheduling. In order to obtain these results, we generalize known results by Grötschel, Lovasz and Schrijver on separation, non-emptiness test, optimization and violation in the
infatuation
发表于 2025-3-27 22:28:32
http://reply.papertrans.cn/87/8604/860325/860325_37.png
替代品
发表于 2025-3-28 02:09:47
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 SL under many-one reductions. This result improves the existing upper bounds for the problem..We also show that the graph automorphism problem for colored graphs with color classes of size 2 is equivalent to deciding whether an undirected graph has more than a single connected component and we prov
宿醉
发表于 2025-3-28 06:51:03
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Setsnt column sets for ., it is NP-complete to decide whether A has any further maximal .-frequent sets, or not, even when the number of such additional maximal .-frequent column sets may be exponentially large. In contrast, all minimal .-infrequent sets of columns of A can be enumerated in incremental
寒冷
发表于 2025-3-28 12:58:54
http://reply.papertrans.cn/87/8604/860325/860325_40.png