Parameterized complexity of the k-arc Chinese Postman Problem

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Opening Hours
Collections
Help Via Email

Electronic Information Resources

Parameterized complexity of the k-arc Chinese Postman Problem

详细信息查看全文

作者：Gregory Gutin ; ^{gutin@cs.rhul.ac.uk" class="auth_mail" title="E-mail the corresponding author} ; Mark Jones ; Bin Sheng
关键词：Mixed Chinese Postman problem ; Fixed parameter tractable
刊名：Journal of Computer and System Sciences
出版年：2017
出版时间：March 2017
年：2017
卷：84
期：Complete
页码：107-119
全文大小：465 K

文摘

bel">•: Mixed Chinese Postman problem.
bel">•: Parameterized by number of arcs.
bel">•: Fixed parameter tractable.

NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.