## Computers and intractability . A guide to the theory of NPcompletness "

- D. S. Johnson
- 1979

- Published 2008 in ArXiv

In this paper, we prove that for every connected gr aph G, there exists a split graph G’ 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… CONTINUE READING

### Presentations referencing similar topics