Art

J-GLOBAL ID：201902217219970624   Reference number：19A2210690

On the minimum clique partitioning problem on weighted chordal graphs

重み付き弦グラフ上の最小クリーク分割問題について【JST・京大機械翻訳】

Author (4)： Jo Changseong (Department of Mathematics Education, Seoul National University, Seoul 08826, Republic of Korea) ,  Choi Jihoon (Department of Mathematics Education, Cheongju University, Cheongju 28503, Republic of Korea) ,  Kim Suh-Ryung (Department of Mathematics Education, Seoul National University, Seoul 08826, Republic of Korea) ,  Sano Yoshio (Division of Information Engineering, Faculty of Engineering, Information and Systems, University of Tsukuba, Ibaraki 305-8573, Japan)
Material： Theoretical Computer Science  (Theoretical Computer Science Part B. Logic, Semantics and Theory of Programming)
Volume： 791  Page： 1-9  Publication year： 2019 
JST Material Number： T0022A  ISSN： 0304-3975  CODEN： TCSDIQ  Document type： Article
Article type： 原著論文  Country of issue： Netherlands (NLD)  Language： ENGLISH (EN)

Abstract/Point： In this paper, we introduce a ...

Register(free) or Log In to access     To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=19A2210690&from=J-GLOBAL&jstjournalNo=T0022A") }}

Thesaurus term： Diamond ,  *algorithm ,  weight ,  ore ,  precious stone
Semi thesaurus term： 区間グラフ , 【Automatic Indexing@JST】

Author keywords (5)： Interval graph ,  Chordal graph ,  Interval-like graph ,  Clique partitioning ,  Approximation algorithms

JST classification (3)： Basics of graph theory  (IA02020S) ,  Artificial intelligence  (JE08000Z) ,  Graphic and image processing in general  (JE04010I)

Terms in the title (3)： 弦 ,  グラフ ,  クリーク