首页 | 本学科首页   官方微博 | 高级检索  
     


Space complexity of perfect matching in bounded genus bipartite graphs
Authors:Samir Datta  Raghav Kulkarni  Raghunath Tewari  N.V. Vinodchandran
Affiliation:1. Chennai Mathematical Institute, Chennai, India;2. University of Chicago, Chicago, IL, USA;3. Indian Institute of Technology Kharagpur, Kharagpur, India;4. University of Nebraska – Lincoln, Lincoln, NE, USA
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号