License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2019.21
URN: urn:nbn:de:0030-drops-115834
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11583/
Kolisetty, Sanjana ;
Le, Linh ;
Volkovich, Ilya ;
Yannakakis, Mihalis
The Complexity of Finding S-Factors in Regular Graphs
Abstract
A graph G has an S-factor if there exists a spanning subgraph F of G such that for all v in V: deg_F(v) in 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.
BibTeX - Entry
@InProceedings{kolisetty_et_al:LIPIcs:2019:11583,
author = {Sanjana Kolisetty and Linh Le and Ilya Volkovich and Mihalis Yannakakis},
title = {{The Complexity of Finding S-Factors in Regular Graphs}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {21:1--21:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Arkadev Chattopadhyay and Paul Gastin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11583},
URN = {urn:nbn:de:0030-drops-115834},
doi = {10.4230/LIPIcs.FSTTCS.2019.21},
annote = {Keywords: constraint satisfaction problem, Dichotomy theorem, Graph Factors, Regular Graphs}
}
|
Keywords: |
|
constraint satisfaction problem, Dichotomy theorem, Graph Factors, Regular Graphs |
|
Collection: |
|
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
04.12.2019 |
