Algorithms for Finding a Most Similar Subforest

Author： Jansson Jesper  

Publisher： Springer Publishing Company

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.48, Iss.4, 2011-05, pp. : 865-887

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Finding a Guard that Sees Most and a Shop that Sells Most

By Cheong Otfried   Efrat Alon   Har-Peled Sariel  

Discrete & Computational Geometry, Vol. 37, Iss. 4, 2007-05 ,pp. : 545-563

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for Finding the Roots of Some Quadratic Octonion Equations

By Wang Qing-Wen   Zhang Xiang   Zhang Yang  

Communications in Algebra, Vol. 42, Iss. 8, 2014-08 ,pp. : 3267-3282

Taylor & Francis Ltd

Access to resources Recommend Favorite

101.06 Finding some integrals using an interesting self-similar substitution

By  

The Mathematical Gazette, Vol. 101, Iss. 550, 2017-02 ,pp. : 103-108

Cambridge University Press

Access to resources Recommend Favorite

Finding pseudoprimes

By  

The Mathematical Gazette, Vol. 95, Iss. 534, 2011-11 ,pp. : 420-432

Cambridge University Press

Access to resources Recommend Favorite

Similar functions and similar bases of polynomials in clifford setting

By Abul-Ez M.A.   Constales D.  

Complex Variables, Vol. 48, Iss. 12, 2003-12 ,pp. : 1055-1070

Taylor & Francis Ltd

Access to resources Recommend Favorite