Mohammed LALOU

Department of M.CS, Institute of Science & Technology University Center A. Boussouf of Mila

Mila, Algeria This email address is being protected from spambots. You need JavaScript enabled to view it.




The K-way vertex cut problem consists in, given a graph G, finding a subset of vertices of a given size, whose removal partitions G into the maximum number of connected components. This problem has many applications in several areas. It has been proven to be NP-complete on general graphs, as well as on...



 Télécharger l'article : On the Complexity of the K-way Vertex Cut Problem