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 2011-12-16 11:15
Reconfiguration of Vertex Covers in Trees and Cacti
Hiroyuki Nooka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2011-39
Abstract (in Japanese) (See Japanese page) 
(in English) We study the problem of reconfiguring a vertex cover of a graph $G$ into another vertex cover via vertex covers of $G$,
each of which results from the previous one by deleting or adding a single vertex,
without ever going through a vertex cover of size more than $k$, for a given integer threshold $k$.
This decision problem is known to be PSPACE-complete for planar graphs.
In this paper, we first give a sufficient condition on the threshold $k$ for which there always exists a reconfiguration between any two vertex covers for cacti.
We then give a linear-time algorithm for trees to compute the minimum threshold $k$ for which there exists a reconfiguration between two given vertex covers.
Keyword (in Japanese) (See Japanese page) 
(in English) algorithm / cactus / reachability on solution space / tree / vertex cover / / /  
Reference Info. IEICE Tech. Rep., vol. 111, no. 360, COMP2011-39, pp. 25-32, Dec. 2011.
Paper # COMP2011-39 
Date of Issue 2011-12-09 (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 COMP2011-39

Conference Information
Committee COMP  
Conference Date 2011-12-16 - 2011-12-16 
Place (in Japanese) (See Japanese page) 
Place (in English) Nagoya Univ. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2011-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Reconfiguration of Vertex Covers in Trees and Cacti 
Sub Title (in English)  
Keyword(1) algorithm  
Keyword(2) cactus  
Keyword(3) reachability on solution space  
Keyword(4) tree  
Keyword(5) vertex cover  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Hiroyuki Nooka  
1st Author's Affiliation Tohoku University (Tohoku Univ.)
2nd Author's Name Takehiro Ito  
2nd Author's Affiliation Tohoku University (Tohoku Univ.)
3rd Author's Name Xiao Zhou  
3rd Author's Affiliation Tohoku University (Tohoku Univ.)
4th Author's Name  
4th Author's Affiliation ()
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-1 
Date Time 2011-12-16 11:15:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2011-39 
Volume (vol) vol.111 
Number (no) no.360 
Page pp.25-32 
#Pages
Date of Issue 2011-12-09 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


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