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 2005-04-18 15:50
Lowering Eccentricity of a Tree by Node-Upgrading
Toshihide Ibaraki (Kwansei Gakuin Univ.), Xiao-Guang Yang (CAS)
Abstract (in Japanese) (See Japanese page) 
(in English) The eccentricity lowering is to reduce the eccentricity of a network by upgrading some nodes (i.e., shrinking the lengthes of the edges linking to such nodes). We consider twotypes of node-upgrading strategies, i.e., the continuous upgrading strategy and the discrete upgrading strategy, where the improvement under the first strategy is a continuous variable, and the improvement under the second strategy is a fixed amount. These problems are hard to approximate for the general graph. Therefore we restrict our attention to graphs with simple structures. We present an $O(|V|^2)$ time algorithm to solve the eccentricity lowering problem under the continuous upgrading strategy when the graph is a tree. However, we show that the problem under the discrete upgrading strategy is binary NP-hard even if the graph is a line.
Keyword (in Japanese) (See Japanese page) 
(in English) eccentricity / node upgrading / discrete upgrading strategy / continuous upgrading strategy / tree / line / convex programming /  
Reference Info. IEICE Tech. Rep., vol. 105, no. 7, COMP2005-8, pp. 57-65, April 2005.
Paper # COMP2005-8 
Date of Issue 2005-04-11 (COMP) 
ISSN Print edition: ISSN 0913-5685
Download PDF

Conference Information
Committee COMP  
Conference Date 2005-04-18 - 2005-04-18 
Place (in Japanese) (See Japanese page) 
Place (in English) Kwansei Gakuin Univ. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2005-04-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Lowering Eccentricity of a Tree by Node-Upgrading 
Sub Title (in English)  
Keyword(1) eccentricity  
Keyword(2) node upgrading  
Keyword(3) discrete upgrading strategy  
Keyword(4) continuous upgrading strategy  
Keyword(5) tree  
Keyword(6) line  
Keyword(7) convex programming  
Keyword(8)  
1st Author's Name Toshihide Ibaraki  
1st Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin Univ.)
2nd Author's Name Xiao-Guang Yang  
2nd Author's Affiliation Chinese Academy of Science (CAS)
3rd Author's Name  
3rd Author's Affiliation ()
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 2005-04-18 15:50:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2005-8 
Volume (vol) vol.105 
Number (no) no.7 
Page pp.57-65 
#Pages
Date of Issue 2005-04-11 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


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