Matches in SemOpenAlex for { <https://semopenalex.org/work/W1582649504> ?p ?o ?g. }
Showing items 1 to 55 of
55
with 100 items per page.
- W1582649504 endingPage "99" @default.
- W1582649504 startingPage "88" @default.
- W1582649504 abstract "We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property ?, and we are asked to find a subset of edges satisfying property ? that uses the minimum number of labels. These problems have a lot of applications in networking. We show that all the problems under consideration are W[2]-hard when parameterized by the number of used labels, and that they remain W[2]-hard even on graphs whose pathwidth is bounded above by a small constant. On the positive side, we prove that most of these problems are FPT when parameterized by the solution size, that is, the size of the sought edge set. For example, we show that computing a maximum matching or an edge dominating set that uses the minimum number of labels, is FPT when parameterized by the solution size. Proving that some of these problems are FPT is nontrivial, and requires interesting and elegant algorithmic methods that we develop in this paper." @default.
- W1582649504 created "2016-06-24" @default.
- W1582649504 creator A5009111693 @default.
- W1582649504 creator A5038603194 @default.
- W1582649504 creator A5054676766 @default.
- W1582649504 date "2010-01-01" @default.
- W1582649504 modified "2023-10-16" @default.
- W1582649504 title "The Parameterized Complexity of Some Minimum Label Problems" @default.
- W1582649504 cites W1518546215 @default.
- W1582649504 cites W1997809628 @default.
- W1582649504 cites W1998751027 @default.
- W1582649504 cites W2048177396 @default.
- W1582649504 cites W2085720608 @default.
- W1582649504 cites W2090200648 @default.
- W1582649504 cites W2095481180 @default.
- W1582649504 cites W2117842753 @default.
- W1582649504 cites W2139317321 @default.
- W1582649504 cites W2156312014 @default.
- W1582649504 cites W4292230561 @default.
- W1582649504 doi "https://doi.org/10.1007/978-3-642-11409-0_8" @default.
- W1582649504 hasPublicationYear "2010" @default.
- W1582649504 type Work @default.
- W1582649504 sameAs 1582649504 @default.
- W1582649504 citedByCount "2" @default.
- W1582649504 countsByYear W15826495042016 @default.
- W1582649504 countsByYear W15826495042018 @default.
- W1582649504 crossrefType "book-chapter" @default.
- W1582649504 hasAuthorship W1582649504A5009111693 @default.
- W1582649504 hasAuthorship W1582649504A5038603194 @default.
- W1582649504 hasAuthorship W1582649504A5054676766 @default.
- W1582649504 hasConcept C11413529 @default.
- W1582649504 hasConcept C165464430 @default.
- W1582649504 hasConcept C41008148 @default.
- W1582649504 hasConceptScore W1582649504C11413529 @default.
- W1582649504 hasConceptScore W1582649504C165464430 @default.
- W1582649504 hasConceptScore W1582649504C41008148 @default.
- W1582649504 hasLocation W15826495041 @default.
- W1582649504 hasOpenAccess W1582649504 @default.
- W1582649504 hasPrimaryLocation W15826495041 @default.
- W1582649504 hasRelatedWork W1974487164 @default.
- W1582649504 hasRelatedWork W1983207144 @default.
- W1582649504 hasRelatedWork W2051058708 @default.
- W1582649504 hasRelatedWork W2357085366 @default.
- W1582649504 hasRelatedWork W2748952813 @default.
- W1582649504 hasRelatedWork W2899084033 @default.
- W1582649504 hasRelatedWork W3001317749 @default.
- W1582649504 hasRelatedWork W4300424690 @default.
- W1582649504 hasRelatedWork W63992065 @default.
- W1582649504 hasRelatedWork W1565072834 @default.
- W1582649504 isParatext "false" @default.
- W1582649504 isRetracted "false" @default.
- W1582649504 magId "1582649504" @default.
- W1582649504 workType "book-chapter" @default.