文献
J-GLOBAL ID:201802270459147791
整理番号:18A0353099
最大内部スパンニング木のためのパラメータ化および近似アルゴリズムのためのより深い局所探索【Powered by NICT】
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
著者 (5件):
Li Wenjun
(School of Information Science and Engineering, Central South University, Changsha, China)
,
Li Wenjun
(School of Computer and Communication Engineering, Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha, China)
,
Cao Yixin
(Department of Computing, Hong Kong Polytechnic University, Hong Kong, China)
,
Chen Jianer
(Department of Computer Science and Engineering, Texas A&M University, College Station, TX, United States)
,
Wang Jianxin
(School of Information Science and Engineering, Central South University, Changsha, China)
資料名:
Information and Computation
(Information and Computation)
巻:
252
ページ:
187-200
発行年:
2017年
JST資料番号:
D0449A
ISSN:
0890-5401
CODEN:
INFCEC
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
オランダ (NLD)
言語:
英語 (EN)