A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs

The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for Pt-free graphs. A recent result presents such an algorithm for P5-free graphs. On the other hand, the complexity status for larger t is still un...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 231; pp. 113 - 118
Main Author: Brause, Christoph
Format: Journal Article
Language:English
Published: Elsevier B.V 20.11.2017
Subjects:
[formula omitted]-free
Independent set
Subexponential-time algorithm
Independent set
Pt-free
Subexponential-time algorithm
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for Pt-free graphs. A recent result presents such an algorithm for P5-free graphs. On the other hand, the complexity status for larger t is still unknown. In this paper we present a subexponential algorithm for the Maximum (Weighted) Independent Set Problem in Pt-free graphs.
AbstractList The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for Pt-free graphs. A recent result presents such an algorithm for P5-free graphs. On the other hand, the complexity status for larger t is still unknown. In this paper we present a subexponential algorithm for the Maximum (Weighted) Independent Set Problem in Pt-free graphs.
Author Brause, Christoph
Author_xml – sequence: 1
  givenname: Christoph
  surname: Brause
  fullname: Brause, Christoph
  email: brause@math.tu-freiberg.de
  organization: Institute of Discrete Mathematics and Algebra, TU Bergakademie Freiberg, Freiberg, Germany
BookMark eNp9kNtKAzEQhoNUsFUfwLu8wK6ZdM1u8KoUD4WKBRX0KmSzkzZlT2RTqW9vSr3yojDMCb6fmX9CRm3XIiE3wFJgIG63aaWblMc2ZTFAnJExFDlPRJ7DiIzjRiQcis8LMhmGLWMM4jQmXzM67Erc91GuDU7XSXANUl2vO-_CpqG28zRskL7ovWt2DV20FfYYUxvoGwa68l1ZY0NdS1chsR6Rrr3uN8MVObe6HvD6r16Sj8eH9_lzsnx9Wsxny8Rw4CGpyszYCgTk1kgpZK6lLa3ILLcyk1BoLgSTmcnAxpPNnTBcwnRaVjLPbYF2eknyo67x3TB4tMq4oIPr2uC1qxUwdXBIbVV0SB0cUiwGiEjCP7L3rtH-5yRzf2QwvvTt0KvBOGwNVs6jCarq3An6F9R3gUk
CitedBy_id crossref_primary_10_1016_j_ipl_2021_106123
crossref_primary_10_1137_20M1367660
crossref_primary_10_1145_3147214
crossref_primary_10_1007_s00453_018_0479_5
crossref_primary_10_1007_s00373_022_02532_9
crossref_primary_10_1007_s00453_020_00745_z
crossref_primary_10_1016_j_tcs_2023_113914
crossref_primary_10_1137_20M1333778
Cites_doi 10.1006/jcss.2000.1727
10.1016/j.dam.2010.01.007
10.1016/j.ipl.2003.07.004
10.1006/jcss.2001.1774
10.1016/j.dam.2008.08.025
10.1016/S0166-218X(99)00046-3
10.1016/S0166-218X(02)00290-1
10.1137/1.9781611973402.43
10.1137/1.9781611974331.ch124
ContentType Journal Article
Copyright 2016 Elsevier B.V.
Copyright_xml – notice: 2016 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.dam.2016.06.016
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 118
ExternalDocumentID 10_1016_j_dam_2016_06_016
S0166218X16302955
GroupedDBID -~X
ADEZE
AFTJW
ALMA_UNASSIGNED_HOLDINGS
FDB
OAUVE
AAYXX
AI.
CITATION
FA8
VH1
WUQ
ID FETCH-LOGICAL-c212t-db4cfd1617fc99697a9fbf64f2f94918a266094c41f012c56c29133bd977f8ef3
ISSN 0166-218X
IngestDate Sat Nov 29 02:59:36 EST 2025
Tue Nov 18 22:25:25 EST 2025
Sat Apr 29 22:38:49 EDT 2023
IsPeerReviewed true
IsScholarly true
Keywords Independent set
Pt-free
Subexponential-time algorithm
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c212t-db4cfd1617fc99697a9fbf64f2f94918a266094c41f012c56c29133bd977f8ef3
PageCount 6
ParticipantIDs crossref_citationtrail_10_1016_j_dam_2016_06_016
crossref_primary_10_1016_j_dam_2016_06_016
elsevier_sciencedirect_doi_10_1016_j_dam_2016_06_016
PublicationCentury 2000
PublicationDate 2017-11-20
PublicationDateYYYYMMDD 2017-11-20
PublicationDate_xml – month: 11
  year: 2017
  text: 2017-11-20
  day: 20
PublicationDecade 2010
PublicationTitle Discrete Applied Mathematics
PublicationYear 2017
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Alekseev (br000005) 1982
Rudin (br000055) 1976
free graphs, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 1784–1803.
Lozin, Rautenbach (br000040) 2003; 88
Mosca (br000045) 1999; 92
D. Lokshantov, M. Vatshelle, Y. Villanger, Independent set in
D. Lokshtanov, M. Pilipczuk, E.J. van Leeuwen, Independence and efficient domination on
free graphs in polynomial time, in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014, pp. 570–581.
Alekseev (br000010) 2004; 135
Garey, Johnson (br000015) 1979
Impagliazzo, Paturi (br000020) 2001; 62
van’t Hof, Paulusma (br000060) 2010; 158
Impagliazzo, Paturi, Zane (br000025) 2001; 63
Randerath, Schiermeyer (br000050) 2010; 158
Mosca (10.1016/j.dam.2016.06.016_br000045) 1999; 92
10.1016/j.dam.2016.06.016_br000035
10.1016/j.dam.2016.06.016_br000030
Garey (10.1016/j.dam.2016.06.016_br000015) 1979
Impagliazzo (10.1016/j.dam.2016.06.016_br000025) 2001; 63
Lozin (10.1016/j.dam.2016.06.016_br000040) 2003; 88
Impagliazzo (10.1016/j.dam.2016.06.016_br000020) 2001; 62
Randerath (10.1016/j.dam.2016.06.016_br000050) 2010; 158
Alekseev (10.1016/j.dam.2016.06.016_br000005) 1982
Alekseev (10.1016/j.dam.2016.06.016_br000010) 2004; 135
van’t Hof (10.1016/j.dam.2016.06.016_br000060) 2010; 158
Rudin (10.1016/j.dam.2016.06.016_br000055) 1976
References_xml – year: 1979
  ident: br000015
  article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness
– volume: 62
  start-page: 367
  year: 2001
  end-page: 375
  ident: br000020
  article-title: On the complexity of k-SAT
  publication-title: J. Comput. System Sci.
– year: 1976
  ident: br000055
  publication-title: Principles of Mathematical Analysis
– volume: 158
  start-page: 731
  year: 2010
  end-page: 740
  ident: br000060
  article-title: A new characterization of
  publication-title: Discrete Appl. Math.
– volume: 63
  start-page: 512
  year: 2001
  end-page: 530
  ident: br000025
  article-title: Which problems have strongly exponential complexity?
  publication-title: J. Comput. System Sci.
– reference: -free graphs, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 1784–1803.
– start-page: 3
  year: 1982
  end-page: 13
  ident: br000005
  article-title: The effect of local constraints on the complexity of determination of the graph independence number
  publication-title: Combinatorial-Algebraic Methods in Applied Mathematics
– volume: 158
  start-page: 1041
  year: 2010
  end-page: 1044
  ident: br000050
  article-title: On maximum independent sets in
  publication-title: Discrete Appl. Math.
– volume: 135
  start-page: 3
  year: 2004
  end-page: 16
  ident: br000010
  article-title: Polynomial algorithm for finding the largest independent sets in graphs without forks
  publication-title: Discrete Appl. Math.
– volume: 92
  start-page: 177
  year: 1999
  end-page: 191
  ident: br000045
  article-title: Stable sets in certain
  publication-title: Discrete Appl. Math.
– reference: D. Lokshantov, M. Vatshelle, Y. Villanger, Independent set in
– reference: D. Lokshtanov, M. Pilipczuk, E.J. van Leeuwen, Independence and efficient domination on
– reference: -free graphs in polynomial time, in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014, pp. 570–581.
– volume: 88
  start-page: 167
  year: 2003
  end-page: 171
  ident: br000040
  article-title: Some results on graphs without long induced paths
  publication-title: Inform. Process. Lett.
– volume: 62
  start-page: 367
  year: 2001
  ident: 10.1016/j.dam.2016.06.016_br000020
  article-title: On the complexity of k-SAT
  publication-title: J. Comput. System Sci.
  doi: 10.1006/jcss.2000.1727
– volume: 158
  start-page: 1041
  year: 2010
  ident: 10.1016/j.dam.2016.06.016_br000050
  article-title: On maximum independent sets in P5-free graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2010.01.007
– volume: 88
  start-page: 167
  year: 2003
  ident: 10.1016/j.dam.2016.06.016_br000040
  article-title: Some results on graphs without long induced paths
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2003.07.004
– volume: 63
  start-page: 512
  year: 2001
  ident: 10.1016/j.dam.2016.06.016_br000025
  article-title: Which problems have strongly exponential complexity?
  publication-title: J. Comput. System Sci.
  doi: 10.1006/jcss.2001.1774
– year: 1979
  ident: 10.1016/j.dam.2016.06.016_br000015
– year: 1976
  ident: 10.1016/j.dam.2016.06.016_br000055
– volume: 158
  start-page: 731
  year: 2010
  ident: 10.1016/j.dam.2016.06.016_br000060
  article-title: A new characterization of P6-free graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2008.08.025
– volume: 92
  start-page: 177
  year: 1999
  ident: 10.1016/j.dam.2016.06.016_br000045
  article-title: Stable sets in certain P6-free graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(99)00046-3
– volume: 135
  start-page: 3
  year: 2004
  ident: 10.1016/j.dam.2016.06.016_br000010
  article-title: Polynomial algorithm for finding the largest independent sets in graphs without forks
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(02)00290-1
– ident: 10.1016/j.dam.2016.06.016_br000035
  doi: 10.1137/1.9781611973402.43
– start-page: 3
  year: 1982
  ident: 10.1016/j.dam.2016.06.016_br000005
  article-title: The effect of local constraints on the complexity of determination of the graph independence number
– ident: 10.1016/j.dam.2016.06.016_br000030
  doi: 10.1137/1.9781611974331.ch124
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.3103983
Snippet The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 113
SubjectTerms [formula omitted]-free
Independent set
Subexponential-time algorithm
Title A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs
URI https://dx.doi.org/10.1016/j.dam.2016.06.016
Volume 231
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELVgy6EcUPlSCxT5wInIUpw4Hz6uoKhFouJQpOUU2Y4NqXbTVZJF-_MZx042KltED1yiyEqcxPMyfuNM3iD0Li8VTMxhSHikSsJSQ4mIEk1YLBMjyzDUQvbFJrLLy3yx4F99vfu2LyeQ1XW-3fL1fzU1tIGx7a-z9zD32Ck0wD4YHbZgdtj-k-HnQbuReru-qW0ikFgSWz4-EMsfN03V_VyNeYUrsa1Wm1VQjYVwu6DVXeBLzPTp5R0xjdZBr2rdTnnsxwrcDfDtkcV-GeVfd-vujdi4so2jgsF0jQHmLUpJFE6XHdOUABlYTP1m5N2383zU_VLqJ1HqnOof_tktFVzDlawKAE177VS6Rwv71hw1Zg4OSWnXBXRR2C4Km5hH04foIMoSns_QwfzibPF5oiFmBfIOh1W33UcmIFvMS7-7hxs-evfpf7fucD9tmVCRqyP0xMcQeO5s_xQ90PUz9Hhigefo-xzvQQEeUYABBRiOxx4FeIICDCjAHgXQjj0KsEPBC_Tt09nVh3Piq2gQBbSkI6VkypQ2jDUKglueCW6kSZmJDGec5gIoGsT4ilEDw6OSVEWcxrEsITIwuTbxSzSr4WaPEdYJzeJMJhFTgumkzE2ZijyOIy4VFTE9QeEwSIXyEvO20smyuNNsJ-j9eMra6av87WA2jHzhCaIjfgXg6-7TXt3nGq_R4e4NeINmXbPRp-iR-tVVbfPWg-s3H7OE1g
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+subexponential-time+algorithm+for+the+maximum+independent+set+problem+in+pt-free+graphs&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Brause%2C+Christoph&rft.date=2017-11-20&rft.issn=0166-218X&rft.volume=231&rft.spage=113&rft.epage=118&rft_id=info:doi/10.1016%2Fj.dam.2016.06.016&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2016_06_016
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon