DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, Jungho | ko |
dc.contributor.author | Eiben, Eduard | ko |
dc.contributor.author | Kwon, O-joung | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2023-10-17T06:02:16Z | - |
dc.date.available | 2023-10-17T06:02:16Z | - |
dc.date.created | 2023-06-11 | - |
dc.date.issued | 2023-10 | - |
dc.identifier.citation | ALGORITHMICA, v.85, no.10, pp.3058 - 3087 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.uri | http://hdl.handle.net/10203/313439 | - |
dc.description.abstract | For a non-negative integer ℓ, the ℓ-leaf power of a tree T is a simple graph G on the leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most ℓ. We provide a polynomial kernel for the problem of deciding whether we can delete at most k vertices to make an input graph a 3-leaf power of some tree. More specifically, we present a polynomial-time algorithm for an input instance (G, k) for the problem to output an equivalent instance (G′,k′) such that k′⩽k and G′ has at most O(k14) vertices. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.title | A Polynomial Kernel for 3-Leaf Power Deletion | - |
dc.type | Article | - |
dc.identifier.wosid | 000985432100001 | - |
dc.identifier.scopusid | 2-s2.0-85158937891 | - |
dc.type.rims | ART | - |
dc.citation.volume | 85 | - |
dc.citation.issue | 10 | - |
dc.citation.beginningpage | 3058 | - |
dc.citation.endingpage | 3087 | - |
dc.citation.publicationname | ALGORITHMICA | - |
dc.identifier.doi | 10.1007/s00453-023-01129-9 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Eiben, Eduard | - |
dc.contributor.nonIdAuthor | Kwon, O-joung | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | l-Leaf power | - |
dc.subject.keywordAuthor | Parameterized | - |
dc.subject.keywordAuthor | Algorithm | - |
dc.subject.keywordAuthor | Kernelization | - |
dc.subject.keywordAuthor | Vertex deletion | - |
dc.subject.keywordPlus | VERTEX | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.