Papers

2013

Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.

Fundamentals of Computation Theory - 19th International Symposium(FCT)

Yuichi Asahiro
Hiroshi Eto
Takehiro Ito
Eiji Miyano

First page: 28
Last page: 39
Language
Publishing type: Research paper (international conference proceedings)
DOI: 10.1007/978-3-642-40164-0_6
Publisher: Springer

Link information

DOI: https://doi.org/10.1007/978-3-642-40164-0_6
DBLP: https://dblp.uni-trier.de/rec/conf/fct/AsahiroEIM13
URL: https://dblp.uni-trier.de/conf/fct/2013
URL: https://dblp.uni-trier.de/db/conf/fct/fct2013.html#AsahiroEIM13

ID information

DOI : 10.1007/978-3-642-40164-0_6
DBLP ID : conf/fct/AsahiroEIM13

Export: BibTeX RIS