◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Christopher Melgaard

2 papers hereh-index 354 citations4 works total

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

author position
  • first author1
  • last author1

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

fields
  • cs.DS1
  • math.NA1

identity via Semantic Scholar / OpenAlex

most citedAn Efficient Algorithm for Unweighted Spectral Graph Sparsification

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

collaborators

2 papers

math.NA2015★ 3 cited

Gaussian Elimination with Randomized Complete Pivoting

Christopher Melgaard, Ming Gu

Gaussian elimination with partial pivoting (GEPP) has long been among the most widely used methods for computing the LU factorization of a given matrix. However, this method is als…

cs.DS2014★ 9 cited

An Efficient Algorithm for Unweighted Spectral Graph Sparsification

David G. Anderson, Ming Gu, Christopher Melgaard

Spectral graph sparsification has emerged as a powerful tool in the analysis of large-scale networks by reducing the overall number of edges, while maintaining a comparable graph L…

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