Complexity results for identifying codes in planar graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Complexity results for identifying codes in planar graphs

Published:2010-08-19 Issue:6 Volume:17 Page:691-710
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:

Author:

Auger David,Charon Irène,Hudry Olivier,Lobstein Antoine

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2009.00750.x/fullpdf

Reference16 articles.

1. Identifying and locating-dominating codes on chains and cycles;Bertrand;European Journal of Combinatorics,2004

2. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard;Charon;Theoretical Computer Science,2003

3. The rectilinear Steiner tree problem is NP-complete;Garey;SIAM Journal on Applied Mathematics,1977

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Codes in the q-ary Lee Hypercube;WSEAS TRANSACTIONS ON MATHEMATICS;2022-04-13

2. Bounding the Trace Function of a Hypergraph with Applications;Springer Proceedings in Mathematics & Statistics;2022

3. Locating-Domination and Identification;Topics in Domination in Graphs;2020

4. Unique (optimal) solutions: Complexity results for identifying and locating–dominating codes;Theoretical Computer Science;2019-05

5. More results on the complexity of identifying problems in graphs;Theoretical Computer Science;2016-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP