« Back to Record
Citation APA

Díaz, J., & Kaminski, M. (2007). MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theoretical computer science, 377(1-3), 271-276.


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/70700

Díaz, J., & Kaminski, M. (2007). MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theoretical computer science, 377(1-3), 271-276.