Shalini Sharma

Ms. Shalini Sharma

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 March 2021 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
SSShalini Sharma
Shalini Sharma
JCJerry Chou
Jerry Chou

14 February 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
SSShalini Sharma
Shalini Sharma
JCJerry Chou
Jerry Chou
In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TSP tour is computed from the previous result instead of the whole graph. In our current work, we have mapped the TSP problem to three partitioning methods named vertex size attribute, edge attribute, and k-means; then, we compared the TSP tour results. We have also examined the effect of increasing the number of partitions on the total computation time. Through our experiments, we have observed that the vertex size attribute performs the best because of a balanced number of vertices in each partition.

25 October 2017
Verified
Book Chapter
Closed access
PDF file
SSShalini Sharma
Shalini Sharma
CKC. Rama Krishna
C. Rama Krishna
SSShano Solanki
Shano Solanki
KKKhushleen Kaur
Khushleen Kaur
SKSharandeep Kaur
Sharandeep Kaur

21 February 2022 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
SPSatyajit Padhy
Satyajit Padhy
MTMing-Han Tsai
Ming-Han Tsai
SSShalini Sharma
Shalini Sharma
JCJerry Chou
Jerry Chou