{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:16Z","timestamp":1759063696794,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>If $G$ be a graph or a digraph, let $\\mathrm{id}(G)$ be the minimum size of an identifying code of $G$ if one exists, and $\\mathrm{id}(G)=+\\infty$ otherwise. For a graph $G$, let $\\mathrm{idor}(G)$ be the minimum of $\\mathrm{id}(D)$ overall orientations $D$ of $G$. We give some lower and upper bounds on $\\mathrm{idor}(G)$. In particular, we show that $\\mathrm{idor}(G)\\leqslant \\frac{3}{2} \\mathrm{id}(G)$ for every graph $G$. We also show that computing $\\mathrm{idor}(G)$ is NP-hard, while deciding whether $\\mathrm{idor}(G)\\leqslant |V(G)|-k$ is polynomial-time solvable for every fixed integer $k$.<\/jats:p>","DOI":"10.37236\/7117","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:37:14Z","timestamp":1578670634000},"source":"Crossref","is-referenced-by-count":4,"title":["On the Minimum Size of an Identifying Code Over All Orientations of a Graph"],"prefix":"10.37236","volume":"25","author":[{"given":"Nathann","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2018,3,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i1p49\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i1p49\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:37:57Z","timestamp":1579235877000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i1p49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,2]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,1,12]]}},"URL":"https:\/\/doi.org\/10.37236\/7117","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,3,2]]},"article-number":"P1.49"}}