◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Bharath Pattabiraman

1 paper hereh-index 8813 citations14 works total

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.DS1
same name
  • Bharath Pattabiraman — 1 paper
  • Bharath Pattabiraman — 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 citedFast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

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

collaborators

1 paper

cs.DS2012★ 12 cited

Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin +2

The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, informatics, and many other areas. Although there exist several algor…

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