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


On the Maximum Uniquely Restricted Matching for Bipartite Graphs
Affiliation:1. Dipartimento di Fisica Universita’ di Milano-Bicocca and Istituto Nazionale di Fisica Nucleare, Sezione di Milano-Bicocca, 3 Piazza della Scienza, 20126 Milano, Italy;2. Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1043, USA;3. Istituto Nazionale di Fisica Nucleare, Sezione di Milano, 16 Via Celoria, 20133 Milano, Italy;1. Universidad de La Rioja, Spain;2. London School of Economics, UK;1. Machine Learning Lab, IIIT Hyderabad, Gachibowli, Hyderabad 500032, India;2. Center for Visual Information Technology, IIIT Hyderabad, Gachibowli, Hyderabad 500032, India;1. School of Mathematics and Statistics, Minnan Normal University, Zhangzhou 363000, PR China;2. Department of Computer Science and Engineering, Minnan Normal University, Zhangzhou 363000, PR China;3. School of Mathematical Sciences, Xiamen University, Xiamen 361005, PR China
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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