Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree

Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano. Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. In Leszek Gasieniec, Frank Wolter, editors, Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings. Volume 8070 of Lecture Notes in Computer Science, pages 28-39, Springer, 2013. [doi]

Abstract

Abstract is missing.