An efficient algorithm for the minimum weight vertex cover 3-path problem on Series-Parallel graphs

ZHANG WenJie, TU JianHua

Journal of Beijing University of Chemical Technology ›› 2019, Vol. 46 ›› Issue (1) : 124-128.

PDF(787 KB)
Welcome to Journal of Beijing University of Chemical Technology, Today is
Email Alert  RSS
PDF(787 KB)
Journal of Beijing University of Chemical Technology ›› 2019, Vol. 46 ›› Issue (1) : 124-128. DOI: 10.13543/j.bhxbzr.2019.01.019

An efficient algorithm for the minimum weight vertex cover 3-path problem on Series-Parallel graphs

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}[J]. {{journal.qiKanMingCheng_EN}}, 2019, 46(1): 124-128 https://doi.org/10.13543/j.bhxbzr.2019.01.019

References

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(787 KB)

Accesses

Citation

Detail

Sections
Recommended

/