FRINK Linked Data Fragments server

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

• W4386891192 abstract "Abstract In the study of parameterized streaming complexity on graph problems, the main goal is to design streaming algorithms for parameterized problems such that $$mathcal {O}(f(k) log ^{mathcal {O}(1)} n)$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mi>f</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>k</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:msup> <mml:mo>log</mml:mo> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:msup> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> space is enough, where f is an arbitrary computable function depending only on the parameter k . However, in the past few years very few positive results have been established. Most of the graph problems that do have streaming algorithms of the above nature are ones where localized checking is required, like Vertex Cover or Maximum Matching parameterized by the size k of the solution we are seeking. Chitnis et al. (SODA’16) have shown that many important parameterized problems that form the backbone of traditional parameterized complexity are known to require $$Omega (n)$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>Ω</mml:mi> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> bits of storage for any streaming algorithm; e.g. Feedback Vertex Set , Even Cycle Transversal , Odd Cycle Transversal , Triangle Deletion or the more general $$mathcal{F}$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>F</mml:mi> </mml:math> - Subgraph Deletion when parameterized by solution size k . Our contribution lies in overcoming the obstacles to efficient parameterized streaming algorithms in graph deletion problems by utilizing the power of parameterization. We focus on the vertex cover size K as the parameter for the parameterized graph deletion problems we consider. In this work, we consider the four most well-studied streaming models: the Ea , Dea , Va (vertex arrival) and Al (adjacency list) models. Surprisingly, the consideration of vertex cover size K in the different models leads to a classification of positive and negative results for problems like $$mathcal{F}$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>F</mml:mi> </mml:math> - Subgraph Deletion and $$mathcal{F}$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mi>F</mml:mi> </mml:math> - Minor Deletion ." @default.
• W4386891192 created "2023-09-21" @default.
• W4386891192 creator A5000594690 @default.
• W4386891192 creator A5015806060 @default.
• W4386891192 creator A5020352999 @default.
• W4386891192 creator A5067692485 @default.
• W4386891192 creator A5068264438 @default.
• W4386891192 date "2023-09-20" @default.
• W4386891192 modified "2023-09-27" @default.
• W4386891192 title "Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams" @default.
• W4386891192 cites W1838629830 @default.
• W4386891192 cites W1964064059 @default.
• W4386891192 cites W1974810008 @default.
• W4386891192 cites W1996472240 @default.
• W4386891192 cites W2003744153 @default.
• W4386891192 cites W2016289973 @default.
• W4386891192 cites W2051856222 @default.
• W4386891192 cites W2078020203 @default.
• W4386891192 cites W2080609813 @default.
• W4386891192 cites W2084595628 @default.
• W4386891192 cites W2104809968 @default.
• W4386891192 cites W2141235933 @default.
• W4386891192 cites W2144050783 @default.
• W4386891192 cites W2300360052 @default.
• W4386891192 cites W2424986266 @default.
• W4386891192 cites W2804511772 @default.
• W4386891192 cites W2900382700 @default.
• W4386891192 cites W2914414140 @default.
• W4386891192 cites W3037240142 @default.
• W4386891192 cites W4229914019 @default.
• W4386891192 cites W4236077470 @default.
• W4386891192 cites W4246633356 @default.
• W4386891192 doi "https://doi.org/10.1007/s00224-023-10136-w" @default.
• W4386891192 hasPublicationYear "2023" @default.
• W4386891192 type Work @default.
• W4386891192 citedByCount "0" @default.
• W4386891192 crossrefType "journal-article" @default.
• W4386891192 hasAuthorship W4386891192A5000594690 @default.
• W4386891192 hasAuthorship W4386891192A5015806060 @default.
• W4386891192 hasAuthorship W4386891192A5020352999 @default.
• W4386891192 hasAuthorship W4386891192A5067692485 @default.
• W4386891192 hasAuthorship W4386891192A5068264438 @default.
• W4386891192 hasBestOaLocation W43868911921 @default.
• W4386891192 hasConcept C11413529 @default.
• W4386891192 hasConcept C132525143 @default.
• W4386891192 hasConcept C165464430 @default.
• W4386891192 hasConcept C41008148 @default.
• W4386891192 hasConcept C80444323 @default.
• W4386891192 hasConcept C80899671 @default.
• W4386891192 hasConceptScore W4386891192C11413529 @default.
• W4386891192 hasConceptScore W4386891192C132525143 @default.
• W4386891192 hasConceptScore W4386891192C165464430 @default.
• W4386891192 hasConceptScore W4386891192C41008148 @default.
• W4386891192 hasConceptScore W4386891192C80444323 @default.
• W4386891192 hasConceptScore W4386891192C80899671 @default.
• W4386891192 hasLocation W43868911921 @default.
• W4386891192 hasOpenAccess W4386891192 @default.
• W4386891192 hasPrimaryLocation W43868911921 @default.
• W4386891192 hasRelatedWork W113281379 @default.
• W4386891192 hasRelatedWork W1550714364 @default.
• W4386891192 hasRelatedWork W1973679146 @default.
• W4386891192 hasRelatedWork W2210407592 @default.
• W4386891192 hasRelatedWork W2357085366 @default.
• W4386891192 hasRelatedWork W2386767533 @default.
• W4386891192 hasRelatedWork W2945806087 @default.
• W4386891192 hasRelatedWork W2952206082 @default.
• W4386891192 hasRelatedWork W4283773362 @default.
• W4386891192 hasRelatedWork W808328477 @default.
• W4386891192 isParatext "false" @default.
• W4386891192 isRetracted "false" @default.
• W4386891192 workType "article" @default.