A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET

Li Weixuan

Journal of Systems Science & Complexity ›› 1991, Vol. 4 ›› Issue (1) : 14-019.

PDF(343 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(343 KB)
Journal of Systems Science & Complexity ›› 1991, Vol. 4 ›› Issue (1) : 14-019.
article

A POLYNOMIAL ALGORITHM FOR FINDING A BUMP OPTIMAL EXTENSION OF AN ORDERED SET

    {{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

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Journal of Systems Science and Complexity, 1991, 4(1): 14-019

References

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

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

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

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉