◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hendrik Peilke

1 paper here

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

author position
  • middle 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 citedA More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs

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

collaborators

1 paper

cs.DS2012★ 1 cited

A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs

Martin Dietzfelbinger, Hendrik Peilke, Michael Rink

We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random gra…

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