On some optimization problems for star-free graphs

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, in Russian

Scientific paper

It is shown that in star-free graphs the maximum independent set problem, the
minimum dominating set problem and the minimum independent dominating set
problem are approximable up to constant factor by any maximal independent set.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On some optimization problems for star-free graphs 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 On some optimization problems for star-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On some optimization problems for star-free graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-193988

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.