The Complexity of Finding {$S$}-factors in Regular Graphs

Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis. The Complexity of Finding {$S$}-factors in Regular Graphs. Electronic Colloquium on Computational Complexity (ECCC), 26:40, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.