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

Spotting Trees with Few Leaves

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:53:35Z
dc.affiliationUniwersytet Warszawski
dc.contributor.authorBjörklund, Andreas
dc.contributor.authorKamat, Vikram
dc.contributor.authorZehavi, Meirav
dc.contributor.authorKowalik, Łukasz
dc.date.accessioned2024-01-26T07:58:36Z
dc.date.available2024-01-26T07:58:36Z
dc.date.issued2017
dc.description.financeNie dotyczy
dc.description.number2
dc.description.volume31
dc.identifier.doi10.1137/15M1048975
dc.identifier.issn0895-4801
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/120456
dc.identifier.weblinkhttps://epubs.siam.org/doi/10.1137/15M1048975
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofSIAM Journal on Discrete Mathematics
dc.relation.pages687–713
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enParameterized complexity
dc.subject.enHamiltonian cycle
dc.subject.enK-Path
dc.subject.enK-Internal Spanning Tree
dc.subject.enAlgebraic techniques
dc.subject.enColoring
dc.subject.enFractional coloring
dc.subject.enVector coloring
dc.titleSpotting Trees with Few Leaves
dc.typeJournalArticle
dspace.entity.typePublication