Efficient Many-To-Many Point Matching in One Dimension

Author： Colannino Justin   Damian Mirela   Hurtado Ferran   Langerman Stefan   Meijer Henk   Ramaswami Suneeta   Souvaine Diane   Toussaint Godfried  

Publisher： Springer Publishing Company

ISSN： 0911-0119

Source： Graphs and Combinatorics, Vol.23, Iss.1, 2007-06, pp. : 169-178

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

Related content

A novel one‐to‐many and many‐to‐one asymmetric encryption model and its algorithms

By  

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 18, 2015-12 ,pp. : 3906-3913

John Wiley & Sons Inc

Access to resources Recommend Favorite

An Efficient Algorithm for Hydrodynamical Interaction of Many Deformable Drops

By Zinchenko A.Z.   Davis R.H.  

Journal of Computational Physics, Vol. 157, Iss. 2, 2000-01 ,pp. : 539-587

Academic Press

Access to resources Recommend Favorite

Best Chebyshev approximation of functions of one and many variables

By Kalenchuk-Porkhanova A.  

Cybernetics and Systems Analysis, Vol. 45, Iss. 6, 2009-11 ,pp. : 988-996

Springer Publishing Company

Access to resources Recommend Favorite

One, Two, Many: Individuality and Collectivity in Mathematics

By Nathanson Melvyn  

The Mathematical Intelligencer, Vol. 33, Iss. 1, 2011-03 ,pp. : 5-8

Springer Publishing Company

Access to resources Recommend Favorite

How Many Ways Can One Draw A Graph?

By Pach* János   Tóth† Géza  

Combinatorica, Vol. 26, Iss. 5, 2006-10 ,pp. : 559-576

Springer Publishing Company

Access to resources Recommend Favorite