Abstract
Abstract We deal with a few issues related to the problem of finding the minimum size of an identifying code in a graph. First, we provide a linear algorithm which computes an identifying code with minimal size in a given tree. Second, we extend known NP-hardness results by showing that this problem remains NP-hard in the class of planar graphs with arbitrary high girth and maximal degree at most 4. We give similar results for the problem of finding the minimum size of an ( r , ⩽ l ) -identifying code, for all r ⩾ 1 and l ∈ { 1 ; 2 } .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
