Author： Calamoneri Tiziana Frascaria Dario Sinaimeri Blerina
Publisher： Oxford University Press
ISSN： 1460-2067
Source： Computer Journal, Vol.56, Iss.7, 2013-07, pp. : 882-886
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
Partitioning vertices of 1-tough graphs into paths
By Bazgan C. Harkat-Benhamdine A. Li H. Wozniak M.
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :
Access to resources
Recommend
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
By Shapira Asaf Yuster Raphael Zwick Uri
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences, Vol. 67, Iss. 2, 2003-09 ,pp. :
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :