基于广度优先遍历的关键路线生成树算法 A Critical Path Spanning Tree Algorithm Based on Breadth-First Traversal

Author： 付冬梅   练丁榑  

Publisher： 汉斯出版社

ISSN： 2161-881X

Source： Computer Science and Application, Vol.02, Iss.02, 2012-06, pp. : 51-56

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Distributed breadth-first search LTL model checking

By Barnat Jiří   Černá Ivana  

Formal Methods in System Design, Vol. 29, Iss. 2, 2006-09 ,pp. : 117-134

Springer Publishing Company

Access to resources Recommend Favorite

Semi-dynamic breadth-first search in digraphs

By Franciosa P.G.   Frigioni D.   Giaccio R.  

Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. : 201-217

Elsevier

Access to resources Recommend Favorite

A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology

By Burton Benjamin  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 772-801

Springer Publishing Company

Access to resources Recommend Favorite

A Spanning Tree Based Approach to Identifying Web Services

By  

International Journal of Web Services Research (IJWSR), Vol. 1, Iss. 1, 2004-01 ,pp. : 1-20

IGI Global_journal

Access to resources Recommend Favorite

An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path

By Wang Nen-Chung   Chu Chih-Ping  

The Journal of Supercomputing, Vol. 34, Iss. 1, 2005-10 ,pp. : 5-26

Springer Publishing Company

Access to resources Recommend Favorite