The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm

DOI10.1007/11809678_31zbMath1162.05363OpenAlexW1568759119MaRDI QIDQ3591342

Krishnaiyan Thulasiraman, Christoforos N. Hadjicostis, Y. Xiao

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11809678_31

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Upper bounds for binary identifying codes ⋮ Locating-Domination and Identification ⋮ Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs

This page was built for publication: The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm