About the finding of independent vertices of a graph
Data Structures and Algorithms
2016-03-08 v1
Abstract
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.
Cite
@article{arxiv.cs/0003078,
title = {About the finding of independent vertices of a graph},
author = {Anatoly D. Plotnikov},
journal= {arXiv preprint arXiv:cs/0003078},
year = {2016}
}
Comments
8 pages, 2 figures