Author: Franciosa P.G. Frigioni D. Giaccio R.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.250, Iss.1, 2001-01, pp. : 201-217
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A uniform approach to semi-dynamic problems on digraphs
By Cicerone S. Frigioni D. nanni U. Pugliese F.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
Distributed breadth-first search LTL model checking
Formal Methods in System Design, Vol. 29, Iss. 2, 2006-09 ,pp. :
基于广度优先遍历的关键路线生成树算法 A Critical Path Spanning Tree Algorithm Based on Breadth-First Traversal
Computer Science and Application, Vol. 02, Iss. 02, 2012-06 ,pp. :
By Nezhad Maryam Amiri Cerdà-Alabern Llorenç Bellalta Boris Zapata Manel Guerrero
International Journal of Ad Hoc and Ubiquitous Computing, Vol. 14, Iss. 3, 2013-12 ,pp. :
By Yan Wei Huang Youfang He Junliang
International Journal of Computer Applications in Technology, Vol. 32, Iss. 4, 2008-11 ,pp. :