IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2013-09-03 15:35
Finding Maximum Regular Induced Subgraphs with Prescribed Degree
Yuichi Asahiro (Kyushu Sangyo Univ.), Takehiro Ito (Tohoku Univ.), Hiroshi Eto, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-31
Abstract (in Japanese) (See Japanese page) 
(in English) We study the problem of finding a maximum vertex-subset $S$ of a given graph $G$ such that the subgraph $G[S]$ induced by $S$ is $r$-regular for a prescribed degree $r ge 0$. We also consider a variant of the problem which requires $G[S]$ to be $r$-regular and connected. Both problems are known to be NP-hard even to approximate for a fixed constant $r$. In this paper, we thus consider the problems whose input graphs are restricted to some special classes of graphs.We first show that the problems are still NP-hard to approximate even if $r$ is a fixed constant and the input graph is either bipartite or planar. On the other hand, both problems are tractable for graphs having tree-like structures, as follows.We give linear-time algorithms to solve the problems for graphs with bounded treewidth; we note that the hidden constant factor of our running time is just a single exponential of the treewidth. Furthermore, both problems are solvable in polynomial time for chordal graphs.
Keyword (in Japanese) (See Japanese page) 
(in English) Regura induced subgraph / planar graph / bipartite graph / chordal graph / bounded treewidth graph / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 198, COMP2013-31, pp. 43-50, Sept. 2013.
Paper # COMP2013-31 
Date of Issue 2013-08-27 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2013-31

Conference Information
Committee COMP  
Conference Date 2013-09-03 - 2013-09-03 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-09-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Finding Maximum Regular Induced Subgraphs with Prescribed Degree 
Sub Title (in English)  
Keyword(1) Regura induced subgraph  
Keyword(2) planar graph  
Keyword(3) bipartite graph  
Keyword(4) chordal graph  
Keyword(5) bounded treewidth graph  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yuichi Asahiro  
1st Author's Affiliation Kyushu Sangyo University (Kyushu Sangyo Univ.)
2nd Author's Name Takehiro Ito  
2nd Author's Affiliation Tohoku University (Tohoku Univ.)
3rd Author's Name Hiroshi Eto  
3rd Author's Affiliation Kyushu Institute of Technology (Kyushu Inst. of Tech.)
4th Author's Name Eiji Miyano  
4th Author's Affiliation Kyushu Institute of Technology (Kyushu Inst. of Tech.)
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-2 
Date Time 2013-09-03 15:35:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2013-31 
Volume (vol) vol.113 
Number (no) no.198 
Page pp.43-50 
#Pages
Date of Issue 2013-08-27 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan