◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Patrick Bisenius

1 paper hereh-index 123 citations1 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

identity via Semantic Scholar / OpenAlex

most citedComputing Top-k Closeness Centrality in Fully-dynamic Graphs

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

collaborators

1 paper

cs.DS2017★ 2 cited

Computing Top-k Closeness Centrality in Fully-dynamic Graphs

Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman +1

Closeness is a widely-studied centrality measure. Since it requires all pairwise distances, computing closeness for all nodes is infeasible for large real-world networks. However,…

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