Clique size bounding technique with application to non-linear codes

Research output: Contribution to conferencePaper

Abstract

A method to give upper estimates for the clique size of intermediately large graphs is introduced. An exhaustive search on a smaller, but related graph is performed. This smaller graph is analyzed to determine not only its maximal clique size, but also the way in which its cliques are distributed over a small number of carefully chosen subsets of its nodes. A set of inequalities which relate these distribution lists to the clique size of the start up graph is presented.

Original languageEnglish (US)
PagesS971-S972
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Other

OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Clique size bounding technique with application to non-linear codes'. Together they form a unique fingerprint.

Cite this