Partition en cliques (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Partition en cliques" in French language version.

refsWebsite

Global rank French rank

2^nd place

3^rd place

580^th place

868^th place

berkeley.edu

Richard Karp, « Reducibility Among Combinatorial Problems », dans R. E. Miller et J. W. Thatcher, Proceedings of a Symposium on the Complexity of Computer Computations, Plenum Press, 1972 (lire en ligne), p. 85–103.

Wolfgang Espelage, Frank Gurski et Egon Wanke, « How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time », dans International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), vol. 2204, Springer, coll. « Lecture Notes in Computer Science », 2001 (DOI 10.1007/3-540-45477-2_12), p. 117–128.
D. Zuckerman, « Linear degree extractors and the inapproximability of Max Clique and Chromatic Number », Theory of Computing, vol. 3,‎ 2007, p. 103–128 (DOI 10.4086/toc.2007.v003a006).
Márcia R. Cerioli, Luerbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti et Bruce A. Reed, « Partition into cliques for cubic graphs: Planar case, complexity and approximation », Discrete Applied Mathematics, vol. 156, n^o 12,‎ juin 2008, p. 2270–2278 (DOI 10.1016/j.dam.2007.10.015).