A Combinatory Detection Problem
From MaRDI portal
Publication:5735189
DOI10.2307/2312835zbMath0123.00205OpenAlexW4238361102MaRDI QIDQ5735189
Harold S. Shapiro, Staffan Söderberg
Publication date: 1963
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2312835
Related Items (27)
Some family of distance pattern distinguishing graphs and realization results ⋮ Bounds on the domination number and the metric dimension of co-normal product of graphs ⋮ Fractional metric dimension of generalized prism graph ⋮ Combinatorics of separation by binary matrices ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Metric dimension and edge metric dimension of windmill graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ On the metric determination of linear dependence graph ⋮ Low complexity inverse mappings on sum-distinct elements of a power set ⋮ Extremal Graph Theory for Metric Dimension and Diameter ⋮ Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension ⋮ The fractional metric dimension of graphs ⋮ On the metric dimension of Cartesian powers of a graph ⋮ Fault-tolerant resolvability of some graphs of convex polytopes ⋮ Locating Number of Biswapped Networks ⋮ The fault‐tolerant beacon set of hexagonal Möbius ladder network ⋮ Approximation complexity of metric dimension problem ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ On Approximation Complexity of Metric Dimension Problem ⋮ Conditional resolvability of honeycomb and hexagonal networks ⋮ Optimal query complexity bounds for finding graphs ⋮ The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) ⋮ Computation of edge resolvability of benzenoid tripod structure ⋮ The locating number of hexagonal Möbius ladder network ⋮ Toward a deterministic polynomial time algorithm with optimal additive query complexity ⋮ Optimal Detection of Two Complementary Defectives ⋮ On some plane graphs and their metric dimension
This page was built for publication: A Combinatory Detection Problem
