External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory

Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang. New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. In Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella, editors, Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II. Volume 9235 of Lecture Notes in Computer Science, pages 151-162, Springer, 2015. [doi]

Authors

Vladimir Braverman

This author has not been identified. Look up 'Vladimir Braverman' in Google

Zaoxing Liu

This author has not been identified. Look up 'Zaoxing Liu' in Google

Tejasvam Singh

This author has not been identified. Look up 'Tejasvam Singh' in Google

N. V. Vinodchandran

This author has not been identified. Look up 'N. V. Vinodchandran' in Google

Lin F. Yang

This author has not been identified. Look up 'Lin F. Yang' in Google
runs on