Matches in SemOpenAlex for { <https://semopenalex.org/work/W4300486827> ?p ?o ?g. }
Showing items 1 to 49 of
49
with 100 items per page.
- W4300486827 abstract "A graph is distance-hereditary if for any pair of vertices, their distance in every connected induced subgraph containing both vertices is the same as their distance in the original graph. The Distance-Hereditary Vertex Deletion problem asks, given a graph $G$ on $n$ vertices and an integer $k$, whether there is a set $S$ of at most $k$ vertices in $G$ such that $G-S$ is distance-hereditary. This problem is important due to its connection to the graph parameter rank-width that distance-hereditary graphs are exactly graphs of rank-width at most $1$. Eiben, Ganian, and Kwon (MFCS' 16) proved that Distance-Hereditary Vertex Deletion can be solved in time $2^{mathcal{O}(k)}n^{mathcal{O}(1)}$, and asked whether it admits a polynomial kernelization. We show that this problem admits a polynomial kernel, answering this question positively. For this, we use a similar idea for obtaining an approximate solution for Chordal Vertex Deletion due to Jansen and Pilipczuk (SODA' 17) to obtain an approximate solution with $mathcal{O}(k^3log n)$ vertices when the problem is a YES-instance, and we exploit the structure of split decompositions of distance-hereditary graphs to reduce the total size." @default.
- W4300486827 created "2022-10-03" @default.
- W4300486827 creator A5022918002 @default.
- W4300486827 creator A5041792622 @default.
- W4300486827 date "2016-10-23" @default.
- W4300486827 modified "2023-09-27" @default.
- W4300486827 title "A Polynomial Kernel for Distance-Hereditary Vertex Deletion" @default.
- W4300486827 doi "https://doi.org/10.48550/arxiv.1610.07229" @default.
- W4300486827 hasPublicationYear "2016" @default.
- W4300486827 type Work @default.
- W4300486827 citedByCount "0" @default.
- W4300486827 crossrefType "posted-content" @default.
- W4300486827 hasAuthorship W4300486827A5022918002 @default.
- W4300486827 hasAuthorship W4300486827A5041792622 @default.
- W4300486827 hasBestOaLocation W43004868271 @default.
- W4300486827 hasConcept C114614502 @default.
- W4300486827 hasConcept C118615104 @default.
- W4300486827 hasConcept C132525143 @default.
- W4300486827 hasConcept C134306372 @default.
- W4300486827 hasConcept C160446614 @default.
- W4300486827 hasConcept C161677786 @default.
- W4300486827 hasConcept C207225210 @default.
- W4300486827 hasConcept C33923547 @default.
- W4300486827 hasConcept C80899671 @default.
- W4300486827 hasConceptScore W4300486827C114614502 @default.
- W4300486827 hasConceptScore W4300486827C118615104 @default.
- W4300486827 hasConceptScore W4300486827C132525143 @default.
- W4300486827 hasConceptScore W4300486827C134306372 @default.
- W4300486827 hasConceptScore W4300486827C160446614 @default.
- W4300486827 hasConceptScore W4300486827C161677786 @default.
- W4300486827 hasConceptScore W4300486827C207225210 @default.
- W4300486827 hasConceptScore W4300486827C33923547 @default.
- W4300486827 hasConceptScore W4300486827C80899671 @default.
- W4300486827 hasLocation W43004868271 @default.
- W4300486827 hasOpenAccess W4300486827 @default.
- W4300486827 hasPrimaryLocation W43004868271 @default.
- W4300486827 hasRelatedWork W1964163546 @default.
- W4300486827 hasRelatedWork W1994148577 @default.
- W4300486827 hasRelatedWork W1998597471 @default.
- W4300486827 hasRelatedWork W2059749917 @default.
- W4300486827 hasRelatedWork W2374778222 @default.
- W4300486827 hasRelatedWork W2771173984 @default.
- W4300486827 hasRelatedWork W2911419036 @default.
- W4300486827 hasRelatedWork W2913751968 @default.
- W4300486827 hasRelatedWork W4246368052 @default.
- W4300486827 hasRelatedWork W4221158113 @default.
- W4300486827 isParatext "false" @default.
- W4300486827 isRetracted "false" @default.
- W4300486827 workType "article" @default.