◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Lavanya Selvaganesh

4 papers hereh-index 4183 citations20 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author4

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.CO2
  • cs.DM1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

most citedEfficient Shortest Path Algorithm Using An Unique And Novel Graph Matrix Representation

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2019★ 1 cited

Efficient Shortest Path Algorithm Using An Unique And Novel Graph Matrix Representation

Sivakumar Karunakaran, Lavanya Selvaganesh

The neighbourhood matrix, NM(G), a novel representation of graphs proposed in \cite {ALPaper} is defined using the neighbourhood sets of the vertices. The matrix also e…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.