Author： Fischer Eldar Yahalom Orly
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.60, Iss.4, 2011-08, pp. : 766-805
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
Efficient algorithms for acyclic colorings of graphs
By Chen Z.-Z.
Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. :
Access to resources
Recommend
Finite-dimensional T-colorings of graphs
By Yeh
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :
Depth-Optimized Convexity Cuts
Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. :
On the Convexity of Precedence Sequencing Games
By Hamers Herbert Klijn Flip Velzen Bas
Annals of Operations Research, Vol. 137, Iss. 1, 2005-07 ,pp. :
Riemannian convexity of functionals
Journal of Global Optimization, Vol. 51, Iss. 2, 2011-10 ,pp. :