发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Perfect matchings in o(
<i>n</i>
log
<i>n</i>
) time in regular bipartite graphs

[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Perfect matchings in o( n log n ) time in regular bipartite graphs

Goel, Ashish; Kapralov, Michael; Khanna, Sanjeev

作者Goel, Ashish; Kapralov, Michael; Khanna, Sanjeev
文件大小463.96KB
发表时间2010
DOI10.1145/1806689.1806697

← 返回【学霸图书馆】主页