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
Book ChapterDOI
Comparison of Two Self-organization and Hierarchical Routing Protocols for Ad Hoc Networks
TL;DR: This study gives an idea of the impact of the use of recursiveness and of the partition of the DHT on self-organization and hierarchical routing in ad hoc networks.
Journal ArticleDOI
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
Lidan Fan,Zhao Zhang,Wei Wang +2 more
TL;DR: A polynomial-time approximation scheme (PTAS) for MWCVC is presented under the condition that the graph is c-local and the problem on unit disk graph is studied.
Proceedings ArticleDOI
Delay Efficient Real-Time Multicast Scheduling in Multi-Hop Wireless Sensor Networks
Xiaohua Xu,Min Song +1 more
TL;DR: This work proposes an efficient distributed routing and scheduling protocol under the protocol interference model and proposes schedulability test schemes for a set of real-time multicast tasks.
Proceedings ArticleDOI
Exploiting wireless broadcast advantage as a network-wide cache
TL;DR: This papertains a measure of WBA in a multihop scenario, and obtains a lower bound on the growth of the broadcast cache in terms of the fewest set of transmissions in the network, which is defined as the minimum set of non-altruistic transmissions.
Journal ArticleDOI
A Robust Localization in Wireless Sensor Networks against Wormhole Attack
TL;DR: The results demonstrate the proposed ConSetLoc can estimate the locations for most of sensor nodes with good accuracy and stability when wormhole attack exists in the network.
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.