Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors

12/20/2017
by   Katharina Klost, et al.
0

Suppose we have an arrangement A of n geometric objects x_1, ..., x_n ⊆R^2 in the plane, with a distinguished point p_i in each object x_i. The generalized transmission graph of A has vertex set {x_1, ..., x_n} and a directed edge x_ix_j if and only if p_j ∈ x_i. Generalized transmission graphs provide a generalized model of the connectivity in networks of directional antennas. The complexity class ∃R contains all problems that can be reduced in polynomial time to an existential sentence of the form ∃ x_1, ..., x_n: ϕ(x_1,..., x_n), where x_1,..., x_n range over R and ϕ is a propositional formula with signature (+, -, ·, 0, 1). The class ∃R aims to capture the complexity of the existential theory of the reals. It lies between NP and PSPACE. Many geometric decision problems, such as recognition of disk graphs and of intersection graphs of lines, are complete for ∃R. Continuing this line of research, we show that the recognition problem of generalized transmission graphs of line segments and of circular sectors is hard for ∃R. As far as we know, this constitutes the first such result for a class of directed graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2022

Beyond circular-arc graphs – recognizing lollipop graphs and medusa graphs

In 1992 Biró, Hujter and Tuza introduced, for every fixed connected grap...
research
02/28/2023

On the geometric thickness of 2-degenerate graphs

A graph is 2-degenerate if every subgraph contains a vertex of degree at...
research
09/13/2019

Characterising circular-arc contact B_0-VPG graphs

A contact B_0-VPG graph is a graph for which there exists a collection o...
research
05/02/2020

Minimum Cuts in Geometric Intersection Graphs

Let 𝒟 be a set of n disks in the plane. The disk graph G_𝒟 for 𝒟 is the ...
research
04/20/2021

Finding Geometric Representations of Apex Graphs is NP-Hard

Planar graphs can be represented as intersection graphs of different typ...
research
02/28/2013

The Complexity of Simultaneous Geometric Graph Embedding

Given a collection of planar graphs G_1,...,G_k on the same set V of n v...
research
09/15/2021

Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model

We present subquadratic algorithms in the algebraic decision-tree model ...

Please sign up or login with your details

Forgot password? Click here to reset