◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sourav Chakraborty

1 paper here

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

author position
  • first author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1
ORCID 0000-0001-9518-6204
same name
  • Sourav Chakraborty — 2 papers, h 20
  • Sourav Chakraborty — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedHardness and Algorithms for Rainbow Connectivity

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

collaborators

1 paper

cs.CC2009★ 10 cited

Hardness and Algorithms for Rainbow Connectivity

Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted…

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