WHjDDg4jwV6T2yf51L4SzxTpvewb3pgDAEuXHqmFd9LYeRpbNGVbM5yiHX43
zhudaming

Personal Information

Gender:Male
Date of Employment:1990-07-01

VIEW MORE
Home > Scientific Research > Paper Publications

A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

Release Time:2019-10-24 Hits:

Institution:计算机科学与技术学院
Journal:Discrete Mathematics
First Author:朱大铭
All the Authors:朱大铭
Document Code:lw-88609
Volume:308
Issue:6
Page Number:3951
Translation or Not:No
Date of Publication:2008-06

Prev One:A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations

Next One:A 1.75-approximation algorithm for unsigned translocation distance

Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University

Click:  | The Last Update Time:..  | Login | SDU