Matches in SemOpenAlex for { <https://semopenalex.org/work/W2988316456> ?p ?o ?g. }
Showing items 1 to 74 of
74
with 100 items per page.
- W2988316456 endingPage "80" @default.
- W2988316456 startingPage "72" @default.
- W2988316456 abstract "Let G be an(a) edge(vertex)-colored graph. A path P of G is called a conflict-free path if there is a color that is used on exactly one of the edges(vertices) of P. The graph G is called conflict-free (vertex-)connected if any two distinct vertices of G are connected by a conflict-free path, whereas the graph G is called strongly conflict-free connected if any two distinct vertices u,v of G are connected by a conflict-free path of length of a shortest path between u and v in G. For a connected graph G, the (strong) conflict-free connection number of G, denoted by (scfc(G))cfc(G), is defined as the smallest number of colors that are required to make G (strongly) conflict-free connected. In this paper, we first investigate the question: Given a connected graph G and a coloring c:E(orV)→{1,2,⋯,k} (k≥1) of G, determine whether or not G is, respectively, conflict-free connected, conflict-free vertex-connected, strongly conflict-free connected under the coloring c. We solve this question by providing polynomial-time algorithms. We then show that the problem of deciding whether scfc(G)≤k (k≥2) for a given graph G is NP-complete. Moreover, we prove that it is NP-complete to decide whether there is a k-edge-coloring (k≥2) of G such that all pairs (u,v)∈P (P⊂V×V) are strongly conflict-free connected." @default.
- W2988316456 created "2019-11-22" @default.
- W2988316456 creator A5016038183 @default.
- W2988316456 creator A5030357379 @default.
- W2988316456 creator A5060372856 @default.
- W2988316456 date "2020-01-01" @default.
- W2988316456 modified "2023-10-05" @default.
- W2988316456 title "(Strong) conflict-free connectivity: Algorithm and complexity" @default.
- W2988316456 cites W2007873061 @default.
- W2988316456 cites W2032004078 @default.
- W2988316456 cites W2034743574 @default.
- W2988316456 cites W2039985220 @default.
- W2988316456 cites W2055242964 @default.
- W2988316456 cites W2083641445 @default.
- W2988316456 cites W2112505974 @default.
- W2988316456 cites W2150438015 @default.
- W2988316456 cites W2589833411 @default.
- W2988316456 cites W2616264412 @default.
- W2988316456 cites W2746905753 @default.
- W2988316456 cites W2794264135 @default.
- W2988316456 cites W2804497917 @default.
- W2988316456 cites W2884611810 @default.
- W2988316456 cites W2891323680 @default.
- W2988316456 cites W2913683243 @default.
- W2988316456 cites W2963062619 @default.
- W2988316456 cites W2963588339 @default.
- W2988316456 doi "https://doi.org/10.1016/j.tcs.2019.10.043" @default.
- W2988316456 hasPublicationYear "2020" @default.
- W2988316456 type Work @default.
- W2988316456 sameAs 2988316456 @default.
- W2988316456 citedByCount "6" @default.
- W2988316456 countsByYear W29883164562020 @default.
- W2988316456 countsByYear W29883164562021 @default.
- W2988316456 crossrefType "journal-article" @default.
- W2988316456 hasAuthorship W2988316456A5016038183 @default.
- W2988316456 hasAuthorship W2988316456A5030357379 @default.
- W2988316456 hasAuthorship W2988316456A5060372856 @default.
- W2988316456 hasConcept C114614502 @default.
- W2988316456 hasConcept C118615104 @default.
- W2988316456 hasConcept C132525143 @default.
- W2988316456 hasConcept C2983226441 @default.
- W2988316456 hasConcept C311688 @default.
- W2988316456 hasConcept C33923547 @default.
- W2988316456 hasConcept C76444178 @default.
- W2988316456 hasConcept C80899671 @default.
- W2988316456 hasConceptScore W2988316456C114614502 @default.
- W2988316456 hasConceptScore W2988316456C118615104 @default.
- W2988316456 hasConceptScore W2988316456C132525143 @default.
- W2988316456 hasConceptScore W2988316456C2983226441 @default.
- W2988316456 hasConceptScore W2988316456C311688 @default.
- W2988316456 hasConceptScore W2988316456C33923547 @default.
- W2988316456 hasConceptScore W2988316456C76444178 @default.
- W2988316456 hasConceptScore W2988316456C80899671 @default.
- W2988316456 hasFunder F4320321001 @default.
- W2988316456 hasLocation W29883164561 @default.
- W2988316456 hasOpenAccess W2988316456 @default.
- W2988316456 hasPrimaryLocation W29883164561 @default.
- W2988316456 hasRelatedWork W2049969628 @default.
- W2988316456 hasRelatedWork W2059451567 @default.
- W2988316456 hasRelatedWork W2066526134 @default.
- W2988316456 hasRelatedWork W2080725679 @default.
- W2988316456 hasRelatedWork W2776184136 @default.
- W2988316456 hasRelatedWork W2915580243 @default.
- W2988316456 hasRelatedWork W2963135821 @default.
- W2988316456 hasRelatedWork W3003480140 @default.
- W2988316456 hasRelatedWork W3092119098 @default.
- W2988316456 hasRelatedWork W3117270560 @default.
- W2988316456 hasVolume "804" @default.
- W2988316456 isParatext "false" @default.
- W2988316456 isRetracted "false" @default.
- W2988316456 magId "2988316456" @default.
- W2988316456 workType "article" @default.