FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2800520541> ?p ?o ?g. }

• W2800520541 abstract "Let (mathrm{Pi }) be a family of graphs. In the classical (mathrm{Pi })-Vertex Deletion problem, given a graph G and a positive integer k, the objective is to check whether there exists a subset S of at most k vertices such that (G-S) is in (mathrm{Pi }). In this paper, we introduce the conflict free version of this classical problem, namely Conflict Free (mathrm{Pi })-Vertex Deletion (CF-(mathrm{Pi })-VD), and study these problems from the viewpoint of classical and parameterized complexity. In the CF-(mathrm{Pi })-VD problem, given two graphs G and H on the same vertex set and a positive integer k, the objective is to determine whether there exists a set (Ssubseteq V(G)), of size at most k, such that (G-S) is in (mathrm{Pi }) and H[S] is edgeless. Initiating a systematic study of these problems is one of the main conceptual contribution of this work. We obtain several results on the conflict free version of several classical problems. Our first result shows that if (mathrm{Pi }) is characterized by a finite family of forbidden induced subgraphs then CF-(mathrm{Pi })-VD is Fixed Parameter Tractable (FPT). Furthermore, we obtain improved algorithms for conflict free version of several well studied problems. Next, we show that if (mathrm{Pi }) is characterized by a “well-behaved” infinite family of forbidden induced subgraphs, then CF-(mathrm{Pi })-VD is W[1]-hard. Motivated by this hardness result, we consider the parameterized complexity of CF-(mathrm{Pi })-VD when H is restricted to well studied families of graphs. In particular, we show that the conflict free versions of several well-known problems such as Feedback Vertex Set, Odd Cycle Transversal, Chordal Vertex Deletion and Interval Vertex Deletion are FPT when H belongs to the families of d-degenerate graphs and nowhere dense graphs." @default.
• W2800520541 created "2018-05-17" @default.
• W2800520541 creator A5024292541 @default.
• W2800520541 creator A5045302816 @default.
• W2800520541 creator A5080656954 @default.
• W2800520541 date "2018-01-01" @default.
• W2800520541 modified "2023-10-06" @default.
• W2800520541 title "Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized" @default.
• W2800520541 cites W1518653692 @default.
• W2800520541 cites W1557755441 @default.
• W2800520541 cites W179052057 @default.
• W2800520541 cites W1964064059 @default.
• W2800520541 cites W1996472240 @default.
• W2800520541 cites W2003744153 @default.
• W2800520541 cites W2004181701 @default.
• W2800520541 cites W2009955311 @default.
• W2800520541 cites W2013937449 @default.
• W2800520541 cites W2014981179 @default.
• W2800520541 cites W2020889718 @default.
• W2800520541 cites W2021844871 @default.
• W2800520541 cites W2043560626 @default.
• W2800520541 cites W2045027193 @default.
• W2800520541 cites W2050524721 @default.
• W2800520541 cites W2051856222 @default.
• W2800520541 cites W2059451253 @default.
• W2800520541 cites W2059453880 @default.
• W2800520541 cites W2084595628 @default.
• W2800520541 cites W2116638623 @default.
• W2800520541 cites W2144050783 @default.
• W2800520541 cites W2205964593 @default.
• W2800520541 cites W2397265210 @default.
• W2800520541 cites W2410078569 @default.
• W2800520541 cites W2914414140 @default.
• W2800520541 cites W2963004666 @default.
• W2800520541 cites W57886417 @default.
• W2800520541 doi "https://doi.org/10.1007/978-3-319-90530-3_17" @default.
• W2800520541 hasPublicationYear "2018" @default.
• W2800520541 type Work @default.
• W2800520541 sameAs 2800520541 @default.
• W2800520541 citedByCount "2" @default.
• W2800520541 countsByYear W28005205412019 @default.
• W2800520541 countsByYear W28005205412020 @default.
• W2800520541 crossrefType "book-chapter" @default.
• W2800520541 hasAuthorship W2800520541A5024292541 @default.
• W2800520541 hasAuthorship W2800520541A5045302816 @default.
• W2800520541 hasAuthorship W2800520541A5080656954 @default.
• W2800520541 hasConcept C114614502 @default.
• W2800520541 hasConcept C118615104 @default.
• W2800520541 hasConcept C132525143 @default.
• W2800520541 hasConcept C165464430 @default.
• W2800520541 hasConcept C199360897 @default.
• W2800520541 hasConcept C2524010 @default.
• W2800520541 hasConcept C33923547 @default.
• W2800520541 hasConcept C41008148 @default.
• W2800520541 hasConcept C53009064 @default.
• W2800520541 hasConcept C80899671 @default.
• W2800520541 hasConcept C97137487 @default.
• W2800520541 hasConceptScore W2800520541C114614502 @default.
• W2800520541 hasConceptScore W2800520541C118615104 @default.
• W2800520541 hasConceptScore W2800520541C132525143 @default.
• W2800520541 hasConceptScore W2800520541C165464430 @default.
• W2800520541 hasConceptScore W2800520541C199360897 @default.
• W2800520541 hasConceptScore W2800520541C2524010 @default.
• W2800520541 hasConceptScore W2800520541C33923547 @default.
• W2800520541 hasConceptScore W2800520541C41008148 @default.
• W2800520541 hasConceptScore W2800520541C53009064 @default.
• W2800520541 hasConceptScore W2800520541C80899671 @default.
• W2800520541 hasConceptScore W2800520541C97137487 @default.
• W2800520541 hasLocation W28005205411 @default.
• W2800520541 hasOpenAccess W2800520541 @default.
• W2800520541 hasPrimaryLocation W28005205411 @default.
• W2800520541 isParatext "false" @default.
• W2800520541 isRetracted "false" @default.
• W2800520541 magId "2800520541" @default.
• W2800520541 workType "book-chapter" @default.