|
|||||
|
|
On maximum internally stable sets of a graph |
|
| Authors: | U J Nieminen |
| Abstract: | The paper makes some remarks on the paper of Hakimi and Frank and shows a simplified way of applying the concept of alternating forest. An algorithm for finding a maximum internally stable set of an undirected graph is constructed and some examples are given. |
| Keywords: | |