AI Chat AI Image Generator AI Video Text to Speech

Metric Dimension

10/09/2019
∙
by   Richard C. Tillquist, et al.
∙
0
∙

In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has been partially funded by the NSF IIS grant 1836914.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 03/10/2018

On a metric generalization of the tt-degrees and effective dimension theory

In this article, we study an analogue of tt-reducibility for points in c...
0 Takayuki Kihara, et al. ∙
research
∙ 11/04/2019

Multilateration of Random Networks with Community Structure

The minimal number of nodes required to multilaterate a network endowed ...
0 Richard D. Tillquist, et al. ∙
research
∙ 09/06/2021

The Second Generalization of the Hausdorff Dimension Theorem for Random Fractals

In this paper, we present a second partial solution for the problem of c...
0 Mohsen Soltanifar, et al. ∙
research
∙ 12/09/2013

On the Estimation of Pointwise Dimension

Our goal in this paper is to develop an effective estimator of fractal d...
0 Shohei Hidaka, et al. ∙
research
∙ 08/31/2020

Extremal results for graphs of bounded metric dimension

Metric dimension is a graph parameter motivated by problems in robot nav...
0 Jesse Geneson, et al. ∙
research
∙ 10/31/2019

A poset metric from the directed maximum common edge subgraph

We study the directed maximum common edge subgraph problem (DMCES) for d...
0 Robert Nerem, et al. ∙
research
∙ 10/22/2019

Sequential metric dimension for random graphs

In the localization game, the goal is to find a fixed but unknown target...
0 Gergely Odor, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal