Author： Cieliebak M. Erlebach T. Liptak Z. Stoye J. Welzl E.
Publisher： Elsevier
ISSN： 0166-218X
Source： Discrete Applied Mathematics, Vol.137, Iss.1, 2004-02, pp. : 27-46
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
Combinatorics of periods in strings
Journal of Combinatorial Theory, Series A, Vol. 104, Iss. 1, 2003-10 ,pp. :
Access to resources
Recommend
Algorithmic Randomness and Measures of Complexity
Bulletin of Symbolic Logic, Vol. 19, Iss. 3, 2013-09 ,pp. :
On the weighted complexity of a regular covering of a graph
Journal of Combinatorial Theory, Series B, Vol. 89, Iss. 1, 2003-09 ,pp. :
European Journal of Combinatorics, Vol. 21, Iss. 1, 2000-01 ,pp. :