The Institute of Electronics, Information and Communication Engineers General Conference
Advanced Search

Presentation Information

3:45 PM - 4:10 PM JST(6:45 AM - 7:10 AM UTC)Candidate for Academic Incentive Award

[DS-2-05]Hardness of Uniquifying Minimum Vertex Covers and Minimum Dominating Sets under Pre-assignments

Takashi Horiyama1, Yasuaki Kobayashi1, Hirotaka Ono2, Kazuhisa Seto1, ○Ryu Suzuki1 (1. Hokkaido Univ., 2. Nagoya Univ.)
PDF DownloadDownload PDF

Keywords:

Pre-assignment Problem,Uniquness of Solutions,Computational Complexity,Graph Theory

Back to Session information