Matches in SemOpenAlex for { <https://semopenalex.org/work/W2063428625> ?p ?o ?g. }
Showing items 1 to 48 of
48
with 100 items per page.
- W2063428625 abstract "Consider a graph $G$ and a collection of connected spanning subgraphs $G_1, G_2, ldots, G_k$, not necessarily edge-disjoint. A subset $U_i$ of the vertex set is said to $d$-$dominate$ $G_i$ if in $G_i$, all the vertices are at distance at most $d$ from some vertex in $U_i$. Alon et al. [Discrete Math., 262 (2003), pp. 17-25] introduced and studied a function $mu(k)$, which is defined as the minimum radius of domination $d$ such that the vertex set of every graph with a collection of $k$ spanning subgraphs can be partitioned into $U_1, U_2, ldots, U_k$ such that $U_i$ $d$-dominates $G_i$. They proved that $mu(k) < frac{3}{2}k$, and the proof yields a polynomial time algorithm for the same. We prove that the problem is $cal NP$-complete, and we also answer a question from their paper by improving their bound to $(frac{3}{2}-epsilon)k$. We also present an algorithm which finds such a coloring in polynomial time." @default.
- W2063428625 created "2016-06-24" @default.
- W2063428625 creator A5053966865 @default.
- W2063428625 creator A5073882192 @default.
- W2063428625 date "2008-01-01" @default.
- W2063428625 modified "2023-09-26" @default.
- W2063428625 title "Matched-Factor d-Domatic Coloring of Graphs" @default.
- W2063428625 doi "https://doi.org/10.1137/060662307" @default.
- W2063428625 hasPublicationYear "2008" @default.
- W2063428625 type Work @default.
- W2063428625 sameAs 2063428625 @default.
- W2063428625 citedByCount "0" @default.
- W2063428625 crossrefType "journal-article" @default.
- W2063428625 hasAuthorship W2063428625A5053966865 @default.
- W2063428625 hasAuthorship W2063428625A5073882192 @default.
- W2063428625 hasConcept C114614502 @default.
- W2063428625 hasConcept C118615104 @default.
- W2063428625 hasConcept C132525143 @default.
- W2063428625 hasConcept C134306372 @default.
- W2063428625 hasConcept C33923547 @default.
- W2063428625 hasConcept C45340560 @default.
- W2063428625 hasConcept C77553402 @default.
- W2063428625 hasConcept C80899671 @default.
- W2063428625 hasConceptScore W2063428625C114614502 @default.
- W2063428625 hasConceptScore W2063428625C118615104 @default.
- W2063428625 hasConceptScore W2063428625C132525143 @default.
- W2063428625 hasConceptScore W2063428625C134306372 @default.
- W2063428625 hasConceptScore W2063428625C33923547 @default.
- W2063428625 hasConceptScore W2063428625C45340560 @default.
- W2063428625 hasConceptScore W2063428625C77553402 @default.
- W2063428625 hasConceptScore W2063428625C80899671 @default.
- W2063428625 hasLocation W20634286251 @default.
- W2063428625 hasOpenAccess W2063428625 @default.
- W2063428625 hasPrimaryLocation W20634286251 @default.
- W2063428625 hasRelatedWork W1957391398 @default.
- W2063428625 hasRelatedWork W2028854762 @default.
- W2063428625 hasRelatedWork W2106097003 @default.
- W2063428625 hasRelatedWork W2151059773 @default.
- W2063428625 hasRelatedWork W2950380069 @default.
- W2063428625 hasRelatedWork W3021022417 @default.
- W2063428625 hasRelatedWork W4207053563 @default.
- W2063428625 hasRelatedWork W4225807786 @default.
- W2063428625 hasRelatedWork W4246450827 @default.
- W2063428625 hasRelatedWork W4291474665 @default.
- W2063428625 isParatext "false" @default.
- W2063428625 isRetracted "false" @default.
- W2063428625 magId "2063428625" @default.
- W2063428625 workType "article" @default.