

Author: Tu Z.
Publisher: Springer Publishing Company
ISSN: 1292-8941
Source: The European Physical Journal E - Soft Matter, Vol.36, Iss.2, 2013-02, pp. : 1-5
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
Related content


Tight Bounds for the Maximum Acyclic Subgraph Problem
Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. :








New Upper Bounds for Maximum Satisfiability
By Niedermeier R. Rossmanith P.
Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. :