Author： Alam M.
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.67, Iss.1, 2013-09, pp. : 3-22
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
A linear-time algorithm to compute a MAD tree of an interval graph
By Dahlhaus E. Dankelmann P. Ravi R.
Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. :
Access to resources
Recommend
Designing a novel linear‐time graph kernel for semantic link network
CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 1532-0626, Iss. 15, 2015-10 ,pp. :
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
By Cole Richard Kowalik Łukasz
Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. :