Nettree for maximum disjoint paths with length constraint in DAG

Nettree for maximum disjoint paths with length constraint in DAG

The problem of the maximum disjoint paths in directed acyclic graphs(DAG)was researched which is to find the maximum disjoint paths with length k between two given vertices.A greedy algorithm named greedy path(GP)was proposed to solve the problem.GP transformed a DAG into a nettree with depth k+1 at...

Full description

Saved in:
Bibliographic Details
Main Authors: Yan LI, You-xi WU, Chun-ping HUANG, Zhi-ying ZHANG, Zhen-xiang ZENG
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2015-08-01
Series:Tongxin xuebao
Subjects:
directed acyclic graph
length constraint
disjoint path
nettree
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015145/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015145/

Similar Items