"Nearly complete graphs decomposable into large induced matchings and their ..."

Noga Alon, Ankur Moitra, Benny Sudakov (2012)

> Home

Details and statistics

DOI: 10.1145/2213977.2214074

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/AlonMS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/AlonMS12
Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly complete graphs decomposable into large induced matchings and their applications. STOC 2012: 1079-1090

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.