Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs

Authors:
Josep Díaz;Marcin Kamiski
Affiliations:
Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, 08034 Barcelona, Spain;RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, USA
Venue:
Theoretical Computer Science
Year:
2007

Citing 9
Cited 5

Unit disk graphs

Discrete Mathematics - Topics on domination
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Unit disk graph recognition is NP-hard

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Approximating layout problems on random geometric graphs

Journal of Algorithms
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the complexity of the maximum cut problem

Nordic Journal of Computing
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs

SIAM Journal on Computing

Approximation algorithms for geometric intersection graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
MAX-CUT and containment relations in graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Post-routing layer assignment for double patterning

Proceedings of the 16th Asia and South Pacific Design Automation Conference
Note: max-cut and containment relations in graphs

Theoretical Computer Science
Post-routing layer assignment for double patterning with timing critical paths consideration

Integration, the VLSI Journal

Quantified Score

Hi-index	5.23

Visualization

Abstract

We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that @l-precision graphs are planar for @l1/2 and give a dichotomy theorem for max-cut computational complexity on @l-precision unit disk graphs.