Author： Bonizzoni Paola
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.48, Iss.3, 2007-07, pp. : 267-285
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 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
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. :
On maximal suffixes and constant-space linear-time versions of KMP algorithm
By Rytter W.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :