Unit disk graph recognition is NP-hard

نویسندگان

  • Heinz Breu
  • David G. Kirkpatrick
چکیده

Unit disk graphs are the intersection graphs of unit diameter closed disks in the plane. This paper reduces SATISFIABILITY to the problem of recognizing unit disk graphs. Equivalently, it shows that determining if a graph has sphericity 2 or less, even if the graph is planar or is known to have sphericity at most 3, is NP-hard. We show how this reduction can be extended to 3 dimensions, thereby showing that unit sphere graph recognition, or determining if a graph has sphericity 3 or less, is also NP-hard. We conjecture that K-sphericity is NP-hard for all xed K greater than 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further Information on Publisher's Website: Httpxggdxfdoiforggihfihhugwuveqettperrrtsev 2 2 Use Policy Minimum Bisection Is Np-hard on Unit Disk Graphs

In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.

متن کامل

Minimum Bisection Is NP-hard on Unit Disk Graphs

In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.

متن کامل

Report On the Approximation of Unit Disk Graph Coordinates

In this paper we study a problem occuring in the context of geometric routing algorithms for mobile ad-hoc networks: Finding unit disk graph coordinates given a graph G = (V, E). Based on a proof that recognition of unit disk graphs is an NP-hard problem, we show that the problem of finding unit disk graph coordinates given a graph G = (V, E) is NPhard. Subsequently, we show that the proof does...

متن کامل

Connected Dominating Sets

PROBLEM DEFINITION Consider a graph G = (V,E). A subset C of V is called a dominating set if every vertex is either in C or adjacent to a vertex in C. If, furthermore, the subgraph induced by C is connected, then C is called a connected dominating set. A connected dominating set with a minimum cardinality is called a minimum connected dominating set (MCDS). Computing a MCDS is an NP-hard proble...

متن کامل

Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees

We wish to decide whether a simply connected flexible polygonal structure can be realized in Euclidean space. Two models are considered: polygonal linkages (body-and-joint framework) and contact graphs of unit disks in the plane. (1) We show that it is strongly NP-hard to decide whether a given polygonal linkage is realizable in the plane when the bodies are convex polygons and their contact gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Geom.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1998