首页    期刊浏览 2024年11月07日 星期四
登录注册

文章基本信息

  • 标题:The Complexity of Finding { S }-factors in Regular Graphs
  • 本地全文:下载
  • 作者:Sanjana Kolisetty ; Linh Le ; Ilya Volkovich
  • 期刊名称:Electronic Colloquium on Computational Complexity
  • 印刷版ISSN:1433-8092
  • 出版年度:2019
  • 卷号:2019
  • 页码:1-12
  • 出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
  • 摘要:

    A graph G has an \emph{ S -factor} if there exists a spanning subgraph F of G such that for all v V : deg F ( v ) S . The simplest example of such factor is a 1 -factor, which corresponds to a perfect matching in a graph. In this paper we study the computational complexity of finding S -factors in regular graphs. Our techniques combine some classical as well as recent tools from graph theory.

  • 关键词:constraint satisfaction problem ; Dichotomy theorem ; Graph Factors ; Regular Graphs
国家哲学社会科学文献中心版权所有