A n^2.5 algorithm for maximum matchings in bipartite graphs-[英文版, John E. Hopcroft & Richard M. Karp] A n^2.5 algorithm for maximum matchings in bipartite graphs-[中文版, John E. Hopcroft & Richard M. Karp] Hopcroft-Karp是计算二分图最大匹配的最快算法(根据《算法导论》第二版;但维基百
Merkle树是Ralph Merkle在1988年发明的,旨在构建更好的数字签名。原文是A DIGITAL SIGNATURE BASED ON A CONVENTIONAL ENCRYPTION FUNCTION本篇论文在Weki百科中显示比较难以读懂(对于非密码学专业的人来说),第二篇参考是Providing Authentication and Integrity in Outsourced Databases using Merkle Hash Tree’s,比较容易读懂。当然两篇文章