Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree
DOI10.1007/978-3-642-40164-0_6zbMath1368.05142OpenAlexW69484320MaRDI QIDQ2842769
Takehiro Ito, Hiroshi Eto, Yuichi Asahiro, Eiji Miyano
Publication date: 16 August 2013
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40164-0_6
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
This page was built for publication: Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree
