Author： Wenk C.
Publisher： Elsevier
ISSN： 1570-8667
Source： Journal of Discrete Algorithms, Vol.1, Iss.5, 2003-10, pp. : 367-385
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
Access to resources
Recommend
How Hard Is Computing the Edit Distance?
Information and Computation, Vol. 165, Iss. 1, 2001-02 ,pp. :
On the average distance of the hypercube tree
International Journal of Computer Mathematics, Vol. 87, Iss. 6, 2010-05 ,pp. :
On the Eigenvalue Two and Matching Number of a Tree
By Fan Yi-zheng
Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 2, 2004-06 ,pp. :
Distance Between Two Vertices of Maximum Matching Graphs
By Liu Yan
Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 4, 2004-11 ,pp. :