"Finding maximum independent sets in graphs arising from coding theory."

Sergiy Butenko et al. (2002)

> Home

Details and statistics

DOI: 10.1145/508791.508897

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/sac/ButenkoPSSS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sac/ButenkoPSSS02
Sergiy Butenko, Panos M. Pardalos, Ivan Sergienko, Vladimir Shylo, Petro Stetsyuk:
Finding maximum independent sets in graphs arising from coding theory. SAC 2002: 542-546

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.