Matches in SemOpenAlex for { <https://semopenalex.org/work/W2170983254> ?p ?o ?g. }
Showing items 1 to 86 of
86
with 100 items per page.
- W2170983254 abstract "For an undirected graph G=(V,E), we say that for l,u,v∈V, l separates u from v if the distance between u and l differs from the distance from v to l. A set of vertices L⊆V is a feasible solution if for every pair of vertices u,v∈V there is l∈L that separates u from v. The metric dimension of a graph is the minimum cardinality of such a feasible solution. Here, we extend this well-studied problem to the case where each vertex v has a non-negative cost, and the goal is to find a feasible solution with a minimum total cost. This weighted version is NP-hard since the unweighted variant is known to be NP-hard. We show polynomial time algorithms for the cases where G is a path, a tree, a cycle, a cograph, a k-edge-augmented tree (that is, a tree with additional k edges) for a constant value of k, and a (not necessarily complete) wheel. The results for paths, trees, cycles, and complete wheels extend known polynomial time algorithms for the unweighted version, whereas the other results are the first known polynomial time algorithms for these classes of graphs even for the unweighted version. Next, we extend the set of graph classes for which computing the unweighted metric dimension of a graph is known to be NPC by showing that for split graphs, bipartite graphs, co-bipartite graphs, and line graphs of bipartite graphs, the problem of computing the unweighted metric dimension of the graph is NPC." @default.
- W2170983254 created "2016-06-24" @default.
- W2170983254 creator A5023269343 @default.
- W2170983254 creator A5064961974 @default.
- W2170983254 creator A5080746477 @default.
- W2170983254 date "2012-01-01" @default.
- W2170983254 modified "2023-09-25" @default.
- W2170983254 title "The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases" @default.
- W2170983254 cites W1973911938 @default.
- W2170983254 cites W2015906942 @default.
- W2170983254 cites W2019020998 @default.
- W2170983254 cites W2026014023 @default.
- W2170983254 cites W2034444732 @default.
- W2170983254 cites W2037298352 @default.
- W2170983254 cites W2105232761 @default.
- W2170983254 cites W2108442028 @default.
- W2170983254 cites W2149149668 @default.
- W2170983254 cites W2157537934 @default.
- W2170983254 cites W4236316415 @default.
- W2170983254 doi "https://doi.org/10.1007/978-3-642-34611-8_14" @default.
- W2170983254 hasPublicationYear "2012" @default.
- W2170983254 type Work @default.
- W2170983254 sameAs 2170983254 @default.
- W2170983254 citedByCount "13" @default.
- W2170983254 countsByYear W21709832542012 @default.
- W2170983254 countsByYear W21709832542013 @default.
- W2170983254 countsByYear W21709832542014 @default.
- W2170983254 countsByYear W21709832542015 @default.
- W2170983254 countsByYear W21709832542016 @default.
- W2170983254 countsByYear W21709832542017 @default.
- W2170983254 countsByYear W21709832542021 @default.
- W2170983254 crossrefType "book-chapter" @default.
- W2170983254 hasAuthorship W2170983254A5023269343 @default.
- W2170983254 hasAuthorship W2170983254A5064961974 @default.
- W2170983254 hasAuthorship W2170983254A5080746477 @default.
- W2170983254 hasConcept C114614502 @default.
- W2170983254 hasConcept C118615104 @default.
- W2170983254 hasConcept C132525143 @default.
- W2170983254 hasConcept C160446614 @default.
- W2170983254 hasConcept C197657726 @default.
- W2170983254 hasConcept C203776342 @default.
- W2170983254 hasConcept C311688 @default.
- W2170983254 hasConcept C33923547 @default.
- W2170983254 hasConcept C41008148 @default.
- W2170983254 hasConcept C43517604 @default.
- W2170983254 hasConcept C60933471 @default.
- W2170983254 hasConcept C80899671 @default.
- W2170983254 hasConceptScore W2170983254C114614502 @default.
- W2170983254 hasConceptScore W2170983254C118615104 @default.
- W2170983254 hasConceptScore W2170983254C132525143 @default.
- W2170983254 hasConceptScore W2170983254C160446614 @default.
- W2170983254 hasConceptScore W2170983254C197657726 @default.
- W2170983254 hasConceptScore W2170983254C203776342 @default.
- W2170983254 hasConceptScore W2170983254C311688 @default.
- W2170983254 hasConceptScore W2170983254C33923547 @default.
- W2170983254 hasConceptScore W2170983254C41008148 @default.
- W2170983254 hasConceptScore W2170983254C43517604 @default.
- W2170983254 hasConceptScore W2170983254C60933471 @default.
- W2170983254 hasConceptScore W2170983254C80899671 @default.
- W2170983254 hasLocation W21709832541 @default.
- W2170983254 hasOpenAccess W2170983254 @default.
- W2170983254 hasPrimaryLocation W21709832541 @default.
- W2170983254 hasRelatedWork W1520879747 @default.
- W2170983254 hasRelatedWork W1970348285 @default.
- W2170983254 hasRelatedWork W2026014023 @default.
- W2170983254 hasRelatedWork W2037298352 @default.
- W2170983254 hasRelatedWork W2037935057 @default.
- W2170983254 hasRelatedWork W2081642180 @default.
- W2170983254 hasRelatedWork W2103905945 @default.
- W2170983254 hasRelatedWork W2105232761 @default.
- W2170983254 hasRelatedWork W2108442028 @default.
- W2170983254 hasRelatedWork W2157537934 @default.
- W2170983254 hasRelatedWork W2174493139 @default.
- W2170983254 hasRelatedWork W2577636362 @default.
- W2170983254 hasRelatedWork W269097313 @default.
- W2170983254 hasRelatedWork W2769128044 @default.
- W2170983254 hasRelatedWork W2888513371 @default.
- W2170983254 hasRelatedWork W3100826043 @default.
- W2170983254 hasRelatedWork W3104926434 @default.
- W2170983254 hasRelatedWork W3128316836 @default.
- W2170983254 hasRelatedWork W51680879 @default.
- W2170983254 hasRelatedWork W2591601145 @default.
- W2170983254 isParatext "false" @default.
- W2170983254 isRetracted "false" @default.
- W2170983254 magId "2170983254" @default.
- W2170983254 workType "book-chapter" @default.