An efficient algorithm for the vertex cover <i>P<sub>k</sub></i> problem on unicyclic graphs

An efficient algorithm for the vertex cover P_k problem on unicyclic graphs

LI YuChao;TU JianHua

Journal of Beijing University of Chemical Technology ›› 2012, Vol. 39 ›› Issue (4) : 125-127.

PDF(899 KB)

Journal of Beijing University of Chemical Technology ›› 2012, Vol. 39 ›› Issue (4) : 125-127.

管理与数理科学

An efficient algorithm for the vertex cover P_k problem on unicyclic graphs

{{article.zuoZhe_EN}}

Author information +

History +

HeighLight

Abstract

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations

{{article.zuoZheEn_L}}. {{article.title_en}}[J]. {{journal.qiKanMingCheng_EN}}, 2012, 39(4): 125-127

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

Funding

RIGHTS & PERMISSIONS

PDF(899 KB)

Accesses

Citation

Detail

Sections

Recommended

Received	Revised	Published
2012-03-26	1900-01-01	2012-07-20
Issue Date
2012-07-20

Please choose a citation manager

Content to export

HeighLight

Abstract

Key words

QR code of this article

Cite this article

{{custom_sec.title}}

{{custom_sec.title}}

References

References

{{custom_fnGroup.title_en}}

Footnotes

{{custom_ack.title_en}}

Funding

RIGHTS & PERMISSIONS

模态框（Modal）标题

Please choose a citation manager

Content to export

HeighLight

Abstract

Key words

QR code of this article

Cite this article

{{custom_sec.title}}

{{custom_sec.title}}

References

References

{{custom_fnGroup.title_en}}

Footnotes

{{custom_ack.title_en}}

Funding

RIGHTS & PERMISSIONS