◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Enzhi Li

7 papers hereh-index 28 citations12 works total

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

author position
  • sole author3
  • first author3
  • last author1

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

fields
  • cond-mat.str-el2
  • cs.DM1
  • cs.LG1
  • cs.SI1
  • math.PR1
  • physics.comp-ph1

identity via Semantic Scholar / OpenAlex

activity
20172024
most citedFrustrated Random Walks: A Faster Algorithm to Evaluate Node Distances on Connected and Undirected Graphs

8 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing cs.SIShow all

1 paper · 1 filter

cs.SI2024

Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs

Enzhi Li, Scott Nickleach, Bilal Fadlallah

A hypergraph is a generalization of a graph that arises naturally when attribute-sharing among entities is considered. Compared to graphs, hypergraphs have the distinct advantage t…

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