« Back to Record
Citation APA

Chun, J., Korman, M., Nöllenburg, M., & Tokuyama, T. (2008). Finding the maximum union of closures is np-hard, even for trees. Proc. of The 11th Japan-Korea Joint Workshop on Algorithms and Computation WAAC’08(2008)


Permalink

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

Chun, J., Korman, M., Nöllenburg, M., & Tokuyama, T. (2008). Finding the maximum union of closures is np-hard, even for trees. Proc. of The 11th Japan-Korea Joint Workshop on Algorithms and Computation WAAC’08(2008)