On Longest Paths of the k-th Order

Qin Yuyuan

Systems Engineering - Theory & Practice ›› 1994, Vol. 14 ›› Issue (5) : 20-26.

PDF(452 KB)
PDF(452 KB)
Systems Engineering - Theory & Practice ›› 1994, Vol. 14 ›› Issue (5) : 20-26. DOI: 10.12011/1000-6788(1994)5-20
论文

On Longest Paths of the k-th Order

  • Qin Yuyuan
Author information +
History +

Abstract

The [1] gives an algorithm with computational complexity of the second order for finding the longest path of the k-th order in networks where k is a prescribed non-negative in-teger. This article discusses fundamental properties among longest paths of the k-th order.It also constructively proves that in a complete network with n vertices, it needs only n2/ 4 mutu-ally independent paths from the initial vertex to the end vertes of the network to cover all the arcs of the networ.

Key words

network / longest path of the k-th order / absolutely non-co-arc path

Cite this article

Download Citations
Qin Yuyuan . On Longest Paths of the k-th Order. Systems Engineering - Theory & Practice, 1994, 14(5): 20-26 https://doi.org/10.12011/1000-6788(1994)5-20
PDF(452 KB)

241

Accesses

0

Citation

Detail

Sections
Recommended

/