2 citations · 3 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
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…
cs.DS2012★ 1 cited
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…