Unit disk graphs
Brent N. Clark,Brent N. Clark,Charles J. Colbourn,Charles J. Colbourn,David S. Johnson,David S. Johnson +5 more
Reads0
Chats0
TLDR
It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs.About:
This article is published in Discrete Mathematics.The article was published on 1991-01-02 and is currently open access. It has received 1525 citations till now. The article focuses on the topics: Indifference graph & Chordal graph.read more
Citations
More filters
Proceedings ArticleDOI
A Comparison between Single and Additive Contribution in RFID Reader-to-Reader Interference Models
TL;DR: The main models of the two families of anti-collision protocols are described, and a comparison is presented, in order to investigate their effectiveness for the study and the evaluation of reader-to-reader collision.
Book ChapterDOI
Theoretical Aspects of Graph Models for MANETs
TL;DR: This work focuses on articles dealing with connectivity of mobile networks and on articles which show that mobility can be used to propagate information between nodes of the network while at the same time maintaining small transmission distances and thus saving energy.
Journal ArticleDOI
Efficient Optimal Overlap Removal: Algorithms and Experiments
TL;DR: Though this problem is NP‐hard, it is shown that rotating the squares by 45 degrees into diamonds allows for a linear or convex quadratic program, and is thus efficiently solvable even for relatively large instances.
Patent
Methods and devices for coordinating the transmissions of access points in WLANs
Yigal Bejerano,Randeep Bhatia +1 more
TL;DR: In this article, the coordination of transmissions by access points (APs) in a wireless local area network (WLAN) is carried out by allowing APs to transmit during slots of a Contention Free Period (CFP).
Book ChapterDOI
Estimating the density of brown plant hoppers from a light-traps network based on unit disk graph
TL;DR: A new approach to estimate the density of Brown Plant Hoppers at provincial scale is introduced based on the topology of a light-traps network (to gather the information about the BPHs) of a province.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Reducibility Among Combinatorial Problems.
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Book
Algorithmic graph theory and perfect graphs
TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.
Journal ArticleDOI
Some simplified NP-complete graph problems
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.