AI Chat AI Image Generator AI Video Text to Speech

On complexity of mutlidistance graph recognition in R^1

10/14/2017

∙

by Mikhail Tikhomirov, et al.

∙

∙

Let A be a set of positive numbers. A graph G is called an A-embeddable graph in R^d if the vertices of G can be positioned in R^d so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R^1 and classify all finite sets A by complexity of this problem in several natural variations.

page 20

page 24

page 28

page 31

page 33

research

∙ 11/09/2022

On the distance-edge-monitoring numbers of graphs

Foucaud et al. [Discrete Appl. Math. 319 (2022), 424-438] recently intro...

0 Chengxu Yang, et al. ∙

research

∙ 06/26/2019

The Complexity of Helly-B_1 EPG Graph Recognition

Golumbic, Lipshteyn and Stern defined in 2009 the class of EPG graphs, a...

0 Claudson F. Bornstein, et al. ∙

research

∙ 03/31/2019

Pebble Exchange Group of Graphs

A graph puzzle Puz(G) of a graph G is defined as follows. A configurati...

0 Tatsuoki Kato, et al. ∙

research

∙ 03/06/2023

The Complexity of Geodesic Spanners

A geometric t-spanner for a set S of n point sites is an edge-weighted g...

0 Sarita de Berg, et al. ∙

research

∙ 02/26/2023

On the Complexity of Recognizing Nerves of Convex Sets

We study the problem of recognizing whether a given abstract simplicial ...

0 Patrick Schnider, et al. ∙

research

∙ 07/30/2021

A common variable minimax theorem for graphs

Let 𝒢 = {G_1 = (V, E_1), …, G_m = (V, E_m)} be a collection of m graphs ...

7 Ronald R. Coifman, et al. ∙

research

∙ 01/30/2018

P not equal to NP

Let G(V,E) be a graph with vertex set V and edge set E, and let X be eit...

0 Koko Kalambay Kayibi, et al. ∙