z-logo
open-access-imgOpen Access
A Critical Path Spanning Tree Algorithm Based on Breadth-First Traversal
Author(s) -
冬梅 付
Publication year - 2012
Publication title -
computer science and application
Language(s) - English
Resource type - Journals
eISSN - 2161-881X
pISSN - 2161-8801
DOI - 10.12677/csa.2012.22010
Subject(s) - tree traversal , computer science , graph traversal , path (computing) , spanning tree , algorithm , theoretical computer science , mathematics , computer network , combinatorics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom