On the Complexity of Clustering Problems

Publisher Website

1 January 1978

book chapter
Published by Springer Nature

p. 45-54
https://doi.org/10.1007/978-3-642-95322-4_5

Abstract

No abstract available

This publication has 3 references indexed in Scilit:

Some simplified NP-complete graph problems
Published by Elsevier ,2002
Planar 3-colorability is polynomial complete
ACM SIGACT News, 1973
Reducibility among Combinatorial Problems
Published by Springer Nature ,1972