Author： Nikolopoulos Stavros D. Palios Leonidas
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.39, Iss.2, 2004-02, pp. : 95-126
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A linear-time recognition algorithm for P 4 -reducible graphs
By M. Nivat Jamison B. Olariu S.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Access to resources
Recommend
On extended P 4 -reducible and extended P 4 -sparse graphs
By Giakoumakis V. Vanherpe J.-M.
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
The Robustness of the p -Norm Algorithms
Machine Learning, Vol. 53, Iss. 3, 2003-01 ,pp. :
HEURISTIC ALGORITHMS FOR SURVIVABLE P2P MULTICASTING
Applied Artificial Intelligence, Vol. 27, Iss. 4, 2013-04 ,pp. :