"A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random ..."

Martin Dietzfelbinger, Hendrik Peilke, Michael Rink (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-30850-5_14

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wea/DietzfelbingerPR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wea/DietzfelbingerPR12
Martin Dietzfelbinger, Hendrik Peilke, Michael Rink:
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. SEA 2012: 148-159

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.