Author： Bourdonov I. B. Kossatchev A. S. Kuliamin V. V.
Publisher： MAIK Nauka/Interperiodica
ISSN： 0361-7688
Source： Programming and Computer Software, Vol.29, Iss.5, 2003-09, pp. : 245-258
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
Shortest path algorithms for nearly acyclic directed graphs
By Takaoka T.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
Access to resources
Recommend
Deterministic Sampling Algorithms for Network Design
By Zuylen Anke
Algorithmica, Vol. 60, Iss. 1, 2011-05 ,pp. :
On congruences of automata defined by directed graphs
By Kelarev A.V. Sokratova O.V.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Efficient algorithms for acyclic colorings of graphs
By Chen Z.-Z.
Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. :