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


Efficient recognition of equimatchable graphs
Affiliation:1. ESSEC Business School, Paris, France;2. LAMSADE UMR 7243, Paris, France;3. Boğaziçi University, Department of Industrial Engineering, Istanbul, Turkey;1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland;2. Gunma University, Tenjin-cho 1-5-1, Kiryu 376-8515, Japan;1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, PR China;2. School of Computer Science and Software Engineering, University of Wollongong, Wollongong, NSW 2522, Australia;1. College of Computer Science & Technology, Zhejiang University of Technology, China;2. Department of Computer Science, Loughborough University, UK;1. Department of Informatics, University of Bergen, Norway;2. Steklov Institute of Mathematics at St. Petersburg, Russian Academy of Sciences, Russia
Abstract:
Keywords:Graph algorithms  Maximal matching  Edge dominating set  Equimatchable
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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