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


The Complexity of the List Homomorphism Problem for Graphs
Authors:László Egri  Andrei Krokhin  Benoit Larose  Pascal Tesson
Affiliation:1. School of Computer Science, McGill University, Montr??al, Canada
2. School of Engineering and Computing Sciences, Durham University, Durham, UK
3. Department of Mathematics and Statistics, Concordia University, Montr??al, Canada
4. Department of Computer Science, Laval University, Quebec City, Canada
Abstract:
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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