2 papers
cs.DS2018
Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)
Hemant Malik, Ovidiu Daescu, Ramaswamy Chandrasekaran
Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we present two algorithms to check if G can be decomposed into two edge disjoint spanning trees, and provide suc…
cs.DS2017
Lexico-minimum Replica Placement in Multitrees
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
In this work, we consider the problem of placing replicas in a data center or storage area network, represented as a digraph, so as to lexico-minimize a previously proposed reliabi…