Matches in SemOpenAlex for { <https://semopenalex.org/work/W1505427821> ?p ?o ?g. }
Showing items 1 to 53 of
53
with 100 items per page.
- W1505427821 abstract "In a graph G = (V, E), an identifying code of G (resp. a locating-dominating code of G) is a subset of vertices C ⊆ V such that N[v] ∩ C ≠ ∅ for all v ∈ V , and N[u] ∩ C ≠ N[v] ∩ C for all u ≠ v, u, v ∈ V (resp. u, v ∈ V [integerdivide] C), where N[u] denotes the closed neighbourhood of v, that is N[u] = N(u) ∪ {u}. These codes model fault-detection problems in multiprocessor systems and are also used for designing location-detection schemes in wireless sensor networks. We give here simple reductions which improve results of the paper [I. Charon, O. Hudry, A. Lobstein, Minimizing the Size of an Identifying or Locating-Dominating Code in a Graph is NP-hard, Theoretical Computer Science 290(3) (2003), 2109-2120], and we show that minimizing the size of an identifying code or a locating-dominating code in a graph is APX-hard, even when restricted to graphs of bounded degree. Additionally, we give approximation algorithms for both problems with approximation ratio O(ln |V |) for general graphs and O(1) in the case where the degree of the graph is bounded by a constant." @default.
- W1505427821 created "2016-06-24" @default.
- W1505427821 creator A5005407145 @default.
- W1505427821 creator A5046564185 @default.
- W1505427821 creator A5059257068 @default.
- W1505427821 date "2008-01-01" @default.
- W1505427821 modified "2023-09-26" @default.
- W1505427821 title "Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs" @default.
- W1505427821 cites W1513939901 @default.
- W1505427821 cites W1595563493 @default.
- W1505427821 cites W1967536892 @default.
- W1505427821 cites W2040924621 @default.
- W1505427821 cites W2100994793 @default.
- W1505427821 cites W2145297213 @default.
- W1505427821 cites W2150495820 @default.
- W1505427821 cites W2486715098 @default.
- W1505427821 hasPublicationYear "2008" @default.
- W1505427821 type Work @default.
- W1505427821 sameAs 1505427821 @default.
- W1505427821 citedByCount "13" @default.
- W1505427821 countsByYear W15054278212012 @default.
- W1505427821 countsByYear W15054278212013 @default.
- W1505427821 countsByYear W15054278212014 @default.
- W1505427821 countsByYear W15054278212015 @default.
- W1505427821 countsByYear W15054278212020 @default.
- W1505427821 crossrefType "journal-article" @default.
- W1505427821 hasAuthorship W1505427821A5005407145 @default.
- W1505427821 hasAuthorship W1505427821A5046564185 @default.
- W1505427821 hasAuthorship W1505427821A5059257068 @default.
- W1505427821 hasConcept C11413529 @default.
- W1505427821 hasConcept C41008148 @default.
- W1505427821 hasConcept C80444323 @default.
- W1505427821 hasConceptScore W1505427821C11413529 @default.
- W1505427821 hasConceptScore W1505427821C41008148 @default.
- W1505427821 hasConceptScore W1505427821C80444323 @default.
- W1505427821 hasLocation W15054278211 @default.
- W1505427821 hasLocation W15054278212 @default.
- W1505427821 hasOpenAccess W1505427821 @default.
- W1505427821 hasPrimaryLocation W15054278211 @default.
- W1505427821 hasRelatedWork W2051487156 @default.
- W1505427821 hasRelatedWork W2073681303 @default.
- W1505427821 hasRelatedWork W2317200988 @default.
- W1505427821 hasRelatedWork W2358668433 @default.
- W1505427821 hasRelatedWork W2376932109 @default.
- W1505427821 hasRelatedWork W2382290278 @default.
- W1505427821 hasRelatedWork W2386767533 @default.
- W1505427821 hasRelatedWork W2390279801 @default.
- W1505427821 hasRelatedWork W2748952813 @default.
- W1505427821 hasRelatedWork W2899084033 @default.
- W1505427821 isParatext "false" @default.
- W1505427821 isRetracted "false" @default.
- W1505427821 magId "1505427821" @default.
- W1505427821 workType "article" @default.