Presentation 2017-12-22
An ILP Formulation for Maximum Lengh Interval Graph Decomposition Problem
Keisuke Inoue,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English)
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # ISEC2017-88,COMP2017-42
Date of Issue 2017-12-14 (ISEC, COMP)

Conference Information
Committee ISEC / COMP
Conference Date 2017/12/21(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Eikokuji Campus, Kochi University of Technology
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Kazuto Ogawa(NHK) / Hiro Ito(Univ. of Electro-Comm.)
Vice Chair Atsushi Fujioka(Kanagawa Univ.) / Shiho Moriai(NICT) / Yushi Uno(Osaka Pref. Univ.)
Secretary Atsushi Fujioka(Tohoku Univ.) / Shiho Moriai(Tokai Univ.) / Yushi Uno(Seikei Univ.)
Assistant Keita Emura(NICT) / Yuichi Komano(TOSHIBA) / Yuuji Suga(IIJ)

Paper Information
Registration To Technical Committee on Information Security / Technical Committee on Theoretical Foundations of Computing
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An ILP Formulation for Maximum Lengh Interval Graph Decomposition Problem
Sub Title (in English)
Keyword(1)
1st Author's Name Keisuke Inoue
1st Author's Affiliation Kanazawa Technical College(KTC)
Date 2017-12-22
Paper # ISEC2017-88,COMP2017-42
Volume (vol) vol.117
Number (no) ISEC-369,COMP-370
Page pp.pp.107-110(ISEC), pp.107-110(COMP),
#Pages 4
Date of Issue 2017-12-14 (ISEC, COMP)