On the minimum edge cover and vertex partition by quasi-cliques problemsReportar como inadecuado




On the minimum edge cover and vertex partition by quasi-cliques problems - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 GATECH - College of Computing 2 Bilkent-CS - Department of Computer Engineering 3 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l-Informatique du Parallélisme 4 LIP - Laboratoire de l-Informatique du Parallélisme

Abstract : A $\gamma$-quasi-clique in a simple undirected graph is a set of vertices which induces a subgraph with the edge density of at least $\gamma$ for $0



Autor: Oguz Kaya - Enver Kayaaslan - Bora Uçar -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados