Matches in SemOpenAlex for { <https://semopenalex.org/work/W2073233463> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W2073233463 endingPage "710" @default.
- W2073233463 startingPage "691" @default.
- W2073233463 abstract "Abstract Let G be a simple, undirected, connected graph with vertex set V ( G ) and 𝒞⊆ V ( G ) be a set of vertices whose elements are called codewords . For v ∈ V ( G ) and r 1, let us denote by I r 𝒞 ( v ) the set of codewords c ∈𝒞 such that d ( v , c ) r , where the distance d ( v , c ) is defined as the length of a shortest path between v and c . More generally, for A ⊆ V ( G ), we define , which is the set of codewords whose minimum distance to an element of A is at most r . If r and l are positive integers, 𝒞 is said to be an ( r , l )‐identifying code if one has I r 𝒞 ( A )≠ I r 𝒞 ( A ′) whenever A and A ′ are distinct subsets of V ( G ) with at most l elements. We consider the problem of finding the minimum size of an ( r , l )‐identifying code in a given graph. It is already known that this problem is NP‐hard in the class of all graphs when l =1 and r 1. We show that it is also NP‐hard in the class of planar graphs with maximum degree at most three for all ( r , l ) with r 1 and l ∈{1, 2}. This shows, in particular, that the problem of computing the minimum size of an ( r , 2)‐identifying code in a given graph is NP‐hard." @default.
- W2073233463 created "2016-06-24" @default.
- W2073233463 creator A5003502766 @default.
- W2073233463 creator A5012958727 @default.
- W2073233463 creator A5085696390 @default.
- W2073233463 creator A5050105289 @default.
- W2073233463 date "2010-08-19" @default.
- W2073233463 modified "2023-10-16" @default.
- W2073233463 title "Complexity results for identifying codes in planar graphs" @default.
- W2073233463 cites W1967536892 @default.
- W2073233463 cites W2014565352 @default.
- W2073233463 cites W2020112047 @default.
- W2073233463 cites W2037020470 @default.
- W2073233463 cites W2037221311 @default.
- W2073233463 cites W2040878396 @default.
- W2073233463 cites W2100994793 @default.
- W2073233463 cites W2145297213 @default.
- W2073233463 cites W2401610261 @default.
- W2073233463 cites W2999628592 @default.
- W2073233463 doi "https://doi.org/10.1111/j.1475-3995.2009.00750.x" @default.
- W2073233463 hasPublicationYear "2010" @default.
- W2073233463 type Work @default.
- W2073233463 sameAs 2073233463 @default.
- W2073233463 citedByCount "20" @default.
- W2073233463 countsByYear W20732334632012 @default.
- W2073233463 countsByYear W20732334632013 @default.
- W2073233463 countsByYear W20732334632014 @default.
- W2073233463 countsByYear W20732334632015 @default.
- W2073233463 countsByYear W20732334632016 @default.
- W2073233463 countsByYear W20732334632019 @default.
- W2073233463 countsByYear W20732334632020 @default.
- W2073233463 countsByYear W20732334632022 @default.
- W2073233463 crossrefType "journal-article" @default.
- W2073233463 hasAuthorship W2073233463A5003502766 @default.
- W2073233463 hasAuthorship W2073233463A5012958727 @default.
- W2073233463 hasAuthorship W2073233463A5050105289 @default.
- W2073233463 hasAuthorship W2073233463A5085696390 @default.
- W2073233463 hasConcept C101837359 @default.
- W2073233463 hasConcept C114614502 @default.
- W2073233463 hasConcept C118615104 @default.
- W2073233463 hasConcept C132525143 @default.
- W2073233463 hasConcept C33923547 @default.
- W2073233463 hasConcept C80899671 @default.
- W2073233463 hasConceptScore W2073233463C101837359 @default.
- W2073233463 hasConceptScore W2073233463C114614502 @default.
- W2073233463 hasConceptScore W2073233463C118615104 @default.
- W2073233463 hasConceptScore W2073233463C132525143 @default.
- W2073233463 hasConceptScore W2073233463C33923547 @default.
- W2073233463 hasConceptScore W2073233463C80899671 @default.
- W2073233463 hasIssue "6" @default.
- W2073233463 hasLocation W20732334631 @default.
- W2073233463 hasOpenAccess W2073233463 @default.
- W2073233463 hasPrimaryLocation W20732334631 @default.
- W2073233463 hasRelatedWork W1719252778 @default.
- W2073233463 hasRelatedWork W2031098440 @default.
- W2073233463 hasRelatedWork W2055443873 @default.
- W2073233463 hasRelatedWork W2400746548 @default.
- W2073233463 hasRelatedWork W2466894780 @default.
- W2073233463 hasRelatedWork W3092119098 @default.
- W2073233463 hasRelatedWork W4212970601 @default.
- W2073233463 hasRelatedWork W4226175138 @default.
- W2073233463 hasRelatedWork W4307385446 @default.
- W2073233463 hasRelatedWork W922283457 @default.
- W2073233463 hasVolume "17" @default.
- W2073233463 isParatext "false" @default.
- W2073233463 isRetracted "false" @default.
- W2073233463 magId "2073233463" @default.
- W2073233463 workType "article" @default.