◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Krishnendu Basuli

2 papers hereh-index 7216 citations40 works total

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

author position
  • middle author1
  • last author1

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

fields
  • cs.DS2

identity via Semantic Scholar / OpenAlex

most citedA combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2023

Similarity analysis of DNA sequences through local distribution of nucleotides in strategic neighborhood

Probir Mondal, Pratyay Banerjee, Debranjan Pal +1

We propose a new alignment-free algorithm by constructing a compact vector representation on R24 of a DNA sequence of arbitrary length. Each component of this vector…

cs.DS2012★ 2 cited

A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost

Barun Biswas, Krishnendu Basuli, Saptarshi Naskar +2

The most popular algorithms for generation of minimal spanning tree are Kruskal and Prim algorithm. Many algorithms have been proposed for generation of all spanning tree. This pap…

◍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.