Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2009-09-24 10:05
Vertex-Deletion-based Enhancement of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph
Hiroyuki Yoshida, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2009-24 NLP2009-60
Abstract (in Japanese) (See Japanese page) 
(in English) The problem of extracting a maximum induced tree of a graph (MAXIT) asks for a vertex set of largest cardinality among those ones each of which induces a tree of a given graph.
It is known that this problem is NP-hard, and several heuristic algorithms for MAXIT have already been proposed.
In this paper, we focused on vertex-deletion-based heuristic algorithms.
We propose improved strategies for choosing vertices to be deleted so that sharpness of solutions may be obtained, and compare their effects by means of results of computing experiment.
Keyword (in Japanese) (See Japanese page) 
(in English) Extraction of induced subgraphs / Maximum induced trees / Vertex deletion of graphs / Heuristic algorithms / Evalution of algorithms / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 199, CAS2009-24, pp. 1-6, Sept. 2009.
Paper # CAS2009-24 
Date of Issue 2009-09-17 (CAS, NLP) 
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 CAS2009-24 NLP2009-60

Conference Information
Committee CAS NLP  
Conference Date 2009-09-24 - 2009-09-25 
Place (in Japanese) (See Japanese page) 
Place (in English) Hiroshima Univ. Higashi Senda Campus 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To CAS 
Conference Code 2009-09-CAS-NLP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Vertex-Deletion-based Enhancement of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph 
Sub Title (in English)  
Keyword(1) Extraction of induced subgraphs  
Keyword(2) Maximum induced trees  
Keyword(3) Vertex deletion of graphs  
Keyword(4) Heuristic algorithms  
Keyword(5) Evalution of algorithms  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Hiroyuki Yoshida  
1st Author's Affiliation Hiroshima University (Hiroshima Univ.)
2nd Author's Name Daisuke Takafuji  
2nd Author's Affiliation Hiroshima University (Hiroshima Univ.)
3rd Author's Name Satoshi Taoka  
3rd Author's Affiliation Hiroshima University (Hiroshima Univ.)
4th Author's Name Toshimasa Watanabe  
4th Author's Affiliation Hiroshima University (Hiroshima Univ.)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2009-09-24 10:05:00 
Presentation Time 25 minutes 
Registration for CAS 
Paper # CAS2009-24, NLP2009-60 
Volume (vol) vol.109 
Number (no) no.199(CAS), no.200(NLP) 
Page pp.1-6 
#Pages 6 
Date of Issue 2009-09-17 (CAS, NLP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan