On the public citation graph

Fault tolerant detectors for distinquishing sets in graphs

0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.20295openalex-snapshot
Liar's domination
inferredcites →https://doi.org/10.1002/net.21560openalex-snapshot
Centroidal bases in graphs
inferredcites →https://doi.org/10.1002/net.3230170105openalex-snapshot
Domination and location in acyclic graphs
inferredcites →https://doi.org/10.1007/s00373-013-1311-2openalex-snapshot
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs
inferredcites →https://doi.org/10.1007/s10878-012-9542-3openalex-snapshot
Hardness results and approximation algorithm for total liar’s domination in graphs
inferredcites →https://doi.org/10.1016/j.dam.2006.03.011openalex-snapshot
On graphs on n vertices having an identifying code of cardinality ⌈log2(n+1)⌉
inferredcites →https://doi.org/10.1016/j.dam.2010.12.010openalex-snapshot
Open neighborhood locating–dominating in trees
inferredcites →https://doi.org/10.1016/j.dam.2013.06.002openalex-snapshot
New bounds on the minimum density of an identifying code for the infinite hexagonal grid
inferredcites →https://doi.org/10.1016/j.dam.2015.04.024openalex-snapshot
Optimal open-locating-dominating sets in infinite triangular grids
inferredcites →https://doi.org/10.1016/j.disc.2006.04.028openalex-snapshot
An optimal locating-dominating set in the infinite triangular grid
inferredcites →https://doi.org/10.1016/j.disc.2008.07.019openalex-snapshot
Liar’s domination in graphs
inferredcites →https://doi.org/10.1016/j.ejc.2003.12.013openalex-snapshot
Identifying and locating-dominating codes on chains and cycles
inferredcites →https://doi.org/10.1016/j.ejc.2004.09.002openalex-snapshot
On locating–dominating sets in infinite grids
inferredcites →https://doi.org/10.1016/j.ejc.2013.04.009openalex-snapshot
Nordhaus–Gaddum bounds for locating domination
inferredcites →https://doi.org/10.1016/j.ic.2007.01.003openalex-snapshot
On identifying codes that are robust against edge changes
inferredcites →https://doi.org/10.1016/j.ipl.2013.07.012openalex-snapshot
A linear time algorithm for liarʼs domination problem in proper interval graphs
inferredcites →https://doi.org/10.1016/s0012-365x(01)00244-8openalex-snapshot
Fault-tolerant locating-dominating sets
inferredcites →https://doi.org/10.1016/s0012-365x(01)00357-0openalex-snapshot
On strongly identifying codes
inferredcites →https://doi.org/10.1109/18.661507openalex-snapshot
On a new class of codes for identifying vertices in graphs
inferredcites →https://doi.org/10.1137/s0895480104444089openalex-snapshot
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
inferredcites →https://doi.org/10.1137/s0895480199360990openalex-snapshot
Bounds for Codes Identifying Vertices in the Hexagonal Grid
inferredcites →https://doi.org/10.1145/2016039.2016134openalex-snapshot
Open neighborhood locating-domination for infinite cylinders
inferredcites →https://doi.org/10.37236/363openalex-snapshot
An Optimal Strongly Identifying Code in the Infinite Triangular Grid
inferredcites →https://doi.org/10.48550/arxiv.2202.02620openalex-snapshot
Graphical parameters for classes of tumbling block graphs
inferredcites →https://doi.org/10.5614/ejgta.2014.2.2.1openalex-snapshot
On open neighborhood locating-dominating in graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.22254openalex-snapshot
Optimal error‐detection system for identifying codes
inferred← citeshttps://doi.org/10.1007/s00009-022-02096-1openalex-snapshot
Resolving sets tolerant to failures in three-dimensional grids
inferred← citeshttps://doi.org/10.1007/s13226-025-00770-0openalex-snapshot
Error-detecting locating domination number of Mycielskian of some classes of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.008openalex-snapshot
Fault-tolerant detectors for distinguishing sets in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.023openalex-snapshot
On redundant locating-dominating sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.014openalex-snapshot
Extremal cubic graphs for fault-tolerant locating domination
inferred← citeshttps://doi.org/10.1142/s179383092250080xopenalex-snapshot
Progress on fault-tolerant locating-dominating sets
inferred← citeshttps://doi.org/10.1142/s1793830925500491openalex-snapshot
Fault-tolerant locating-dominating sets with error-correction
inferred← citeshttps://doi.org/10.1145/3603287.3651212openalex-snapshot
Open-Locating-Dominating Sets with Error Correction
inferred← citeshttps://doi.org/10.2139/ssrn.7589356openalex-snapshot
Fractional Open-Locating-Dominating Sets
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-6518openalex-snapshot
Error-detecting locating dominating sets of Mycielskian of a graph
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.