vq0ZIa86kMHzWpu2BbRYJTRrWSnkyuWcg9ngKNGE5JRCFmiBOcO8W9VZ7WkB
Current position: Home >> Scientific Research >> Paper Publications

Computing the Number of Loop-free K-hop Paths of Networks

Hits:

Title of Paper:Computing the Number of Loop-free K-hop Paths of Networks

Journal:IEEE Transactions on Services Computing

First Author:吴建设

Volume:15

Issue:4

Page Number:2114-8

Translation or Not:No

Date of Publication:2022-07-01

Date:2024-04-08

Prev One:基于多智能体近端策略优化的分布式动态火力分配方法

Next One:Graph Label Prediction Based on Local Structure Characteristics Representation