External Links

Cite Key

Statistics

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

PDF

Tags

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.

Hardness of Approximating Problems on Cubic Graphs

Paola Alimonti, Viggo Kann. Hardness of Approximating Problems on Cubic Graphs. In Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista, editors, Algorithms and Complexity, Third Italian Conference, CIAC 97, Rome, Italy, March 12-14, 1997, Proceedings. Volume 1203 of Lecture Notes in Computer Science, pages 288-298, Springer, 1997.

No reviews for this publication, yet.

runs on