About the finding of independent vertices of a graph

Details About the finding of independent vertices of a graph About the finding of independent vertices of a graph

2000-03-24

arxiv.org/abs/cs/0003078v1

Computer Science

Data Structures and Algorithms

8 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

About the finding of independent vertices of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with About the finding of independent vertices of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and About the finding of independent vertices of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149565