Finding maximum independent sets in graphs arising from coding theory

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Conference

Publisher: ACM

Publication date (Print): March 11 2002

Publication date (Online): March 11 2002

Publication date (Print): March 11 2002

Publication date (Electronic): March 11 2002

Pages: 542-546

Affiliations

[1 ]University of Florida, Gainesville, FL

[2 ]Institute of Cybernetics, NAS of Ukraine, Kiev, Ukraine

Article

DOI: 10.1145/508791.508897

SO-VID: dcd4b3db-c4fc-4ba8-9972-c48efcb73cf2

Conference name: SAC02: 2002 ACM Symposium on Applied Computing

Conference acronym: SAC02

Conference location: Madrid Spain

Conference date: 11 03 2002 14 03 2002

Conference sponsor: SIGAPP ACM Special Interest Group on Applied Computing

History

ScienceOpen disciplines: Quantitative & Systems biology,Biophysics

Data availability:

ScienceOpen disciplines: Quantitative & Systems biology, Biophysics

Comments

Comment on this article

scite_

Cited by 4

See all cited by