Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Subexponential-Time Algorithms for Maximum Independent Set in Pt -Free and Broom-Free Graphs

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:31:16Z
dc.affiliationUniwersytet Warszawski
dc.contributor.authorPilipczuk, Marcin
dc.contributor.authorLokshtanov, Daniel
dc.contributor.authorBacsó, Gábor
dc.contributor.authorTuza, Zsolt
dc.contributor.authorMarx, Dániel
dc.contributor.authorvan Leeuwen, Erik Jan
dc.date.accessioned2024-01-26T09:20:50Z
dc.date.available2024-01-26T09:20:50Z
dc.date.issued2019
dc.description.financeNie dotyczy
dc.description.number2
dc.description.volume81
dc.identifier.doi10.1007/S00453-018-0479-5
dc.identifier.issn0178-4617
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/121044
dc.identifier.weblinkhttp://link.springer.com/article/10.1007/s00453-018-0479-5/fulltext.html
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofAlgorithmica
dc.relation.pages421-438
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enIndependent set
dc.subject.enSubexponential algorithms
dc.subject.enApproximation
dc.subject.enScattered set
dc.subject.enH-free graphs
dc.titleSubexponential-Time Algorithms for Maximum Independent Set in Pt -Free and Broom-Free Graphs
dc.typeJournalArticle
dspace.entity.typePublication