Dense Subgraphs on Dynamic Networks
(2012)
Book Chapter
Das Sarma, A., Lall, A., Nanongkai, D., & Trehan, A. (2012). Dense Subgraphs on Dynamic Networks. In M. Aguilera (Ed.), Distributed Computing (151-165). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_11
Self-healing using virtual structures (2012)
Journal Article
Trehan, A. (2012). Self-healing using virtual structures
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack (2012)
Journal Article
Hayes, T. P., Saia, J., & Trehan, A. (2012). The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing, 1-18. https://doi.org/10.1007/s00446-012-0160-1
Composition Games for Distributed Systems: the EU Grant games (Abstract) (2012)
Conference Proceeding
Kutten, S., Lavi, R., & Trehan, A. (2012). Composition Games for Distributed Systems: the EU Grant games (Abstract).
Brief announcement: maintaining large dense subgraphs on dynamic networks (2012)
Conference Proceeding
Das Sarma, A., Lall, A., Nanongkai, D., & Trehan, A. (2012). Brief announcement: maintaining large dense subgraphs on dynamic networks.
Edge-preserving self-healing: keeping network backbones densely connected (2012)
Conference Proceeding
Das Sarma, A., & Trehan, A. (2012). Edge-preserving self-healing: keeping network backbones densely connected.
A general technique to establish the asymptotic conditional diagnosability of interconnection networks (2012)
Journal Article
Stewart, I. (2012). A general technique to establish the asymptotic conditional diagnosability of interconnection networks. Theoretical Computer Science, 452, 132-147. https://doi.org/10.1016/j.tcs.2012.05.015
On the computational complexity of routing in faulty k-ary n-cubes and hypercubes. (2012)
Journal Article
Stewart, I. (2012). On the computational complexity of routing in faulty k-ary n-cubes and hypercubes. Parallel Processing Letters, 22(1), Article 1250003. https://doi.org/10.1142/s012962641250003xWe equate a routing algorithm in a (faulty) interconnection network whose underlying graph is a k-ary n-cube or a hypercube, that attempts to route a packet from a fixed source node to a fixed destination node, with the sub-digraph of (healthy) links... Read More about On the computational complexity of routing in faulty k-ary n-cubes and hypercubes..
Node-to-node disjoint paths in k-ary n-cubes with faulty edges. (2012)
Conference Proceeding
Xiang, Y., Stewart, I., & Madelaine, F. (2012). Node-to-node disjoint paths in k-ary n-cubes with faulty edges. In 2011 IEEE 17th International Conference on Parallel and Distributed Systems (ICPADS 2011). Proceedings of a meeting held 7-9 December 2011, Tainan, Taiwan (181-187). https://doi.org/10.1109/icpads.2011.85Let u and v be any two given nodes in a k-ary n-cube Qnk with at most 2n-2 faulty edges. Suppose that the number of healthy links incident with u is no more than that of v, and denote this number by m. In this paper, we show that there are m mutually... Read More about Node-to-node disjoint paths in k-ary n-cubes with faulty edges..