About the finding of independent vertices of a graph
<|reference_start|>About the finding of independent vertices of a graph: We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is formulated which is dual to the problem above. It is shown that, for trivial twin-orthogonal graphs, any of its maximal independent set is also maximum one.<|reference_end|>
@article{plotnikov2000about,
    title={About the finding of independent vertices of a graph},
    author={Anatoly D. Plotnikov},
    journal={About the finding of independent vertices of a graph, Journal
  "Kibernetika", No. 1, 1989, p. 119 - 121},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0003078},
    primaryClass={cs.DS}
}