Le probleme de l'isomorphisme de graphes est dans P
This paper has been withdrawn by the author, due to possible counter-examples.
cs.DM↗
arXiv subjects
Omar Kettani
Publications and source records attributed to Omar Kettani.
An algorithm for finding the Independence Number of a graph
In this paper, we prove that for every connected graph G, there exists a split graph H with the same independence number and the same order. Then we propose a first algorithm for finding this graph, given the degree sequence of the input graph G. Further, we propose a second algorithm for finding the independence number of G, given the adjacency matrix of G.
cs.DM↗
An algorithm for solving the Independent Set problem
This paper has been withdrawn by the author, due an error in claim 1.
cs.DM↗