2 citations · 3 across the 4 of their papers we have counts for
4 papers
GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks
Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre +1
Given a temporal graph G, a source vertex s, and a departure time at source vertex t_s, the earliest arrival time problem EAT is to start from s on or after t_s and reach all the v…
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
N. S. Narayanaswamy, G. Ramakrishna
A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the grap…
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees
N. S. Narayanaswamy, G. Ramakrishna
For a weighted outerplanar graph, the set of lex short cycles is known to be a minimum cycle basis [Inf. Process. Lett. 110 (2010) 970-974 ]. In this work, we show that the set of…
Tree t-spanners in Outerplanar Graphs via Supply Demand Partition
N. S. Narayanaswamy, G. Ramakrishna
A tree t-spanner of an unweighted graph G is a spanning tree T such that for every two vertices their distance in T is at most t times their distance in G. Given an unweighted grap…