2 citations · 2 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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.DS2018
k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler
Hemant Malik, Ovidiu Daescu
Given an array A of n real numbers, the maximum subarray problem is to find a contiguous subarray which has the largest sum. The k-maximum subarrays problem is to find k such subar…