New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths

New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden... The independent set problem is solvable in polynomial time for the graphs not containing the path P k for any fixed k. If the induced path P k is forbidden then the complexity of this problem is unknown for k > 6. We consider the intermediate cases that the induced path P k and some of its spanning supergraphs are forbidden. We prove the solvability of the independent set problem in polynomial time for the following cases: (1) the supergraphs whose minimal degree is less than k/2 are forbidden; (2) the supergraphs whose complementary graph has more than k/2 edges are forbidden; (3) the supergraphs from which we can obtain P k by means of graph intersection are forbidden. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Applied and Industrial Mathematics Springer Journals

New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths

Loading next page...
 
/lp/springer_journal/new-cases-of-the-polynomial-solvability-of-the-independent-set-problem-VZkhsFIprB
Publisher
Pleiades Publishing
Copyright
Copyright © 2018 by Pleiades Publishing, Ltd.
Subject
Mathematics; Mathematics, general
ISSN
1990-4789
eISSN
1990-4797
D.O.I.
10.1134/S1990478918020023
Publisher site
See Article on Publisher Site

Abstract

The independent set problem is solvable in polynomial time for the graphs not containing the path P k for any fixed k. If the induced path P k is forbidden then the complexity of this problem is unknown for k > 6. We consider the intermediate cases that the induced path P k and some of its spanning supergraphs are forbidden. We prove the solvability of the independent set problem in polynomial time for the following cases: (1) the supergraphs whose minimal degree is less than k/2 are forbidden; (2) the supergraphs whose complementary graph has more than k/2 edges are forbidden; (3) the supergraphs from which we can obtain P k by means of graph intersection are forbidden.

Journal

Journal of Applied and Industrial MathematicsSpringer Journals

Published: May 29, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off