程 鵬

On the Equivalence in Complexity among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph(coauthor) 'jointly woeked' 

Information Processing Letters 51(4) 195-199 1994年  

Complexity of Computing the Expected Maximum Number of Edge-Disjoint s-t Paths on Probabilistic Graphs(coauthor) 

The Transactions of the Institute of Electronics, Information and Communication Engineers A J76-A(6) 850-859 1993年  

Properties on the Average Number of spannung Trees in Connected spanning Subgraphs for an Unclire cted Graph 'jointly woeked' 

IEICE TRANS on Fundamentals of Electronics, Commnunications and Computer Sciences E86-A(5) 1027-1033