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 2016-09-15 11:05
A Fast Method for Finding the Edge to be Inserted to Minimize Betweenness Centrality of a Specified Vertex
Toshiyuki Namba, Tatsuki Kohno, Norikazu Takahashi (Okayama Univ.) NLP2016-56
Abstract (in Japanese) (See Japanese page) 
(in English) Betweenness centrality is a measure that represents the importance of each vertex of a graph. From the viewpoint of the robustness against attacks and failures, it is desired that all vertices take similar values of the betweenness centrality. A simple way to increase the robustness of a given graph is to insert a small number of edges so that the largest betweenness centrality decreases as much as possible. In this paper, we consider the problem of finding an edge to be inserted in order to minimize the betweenness centrality of a specified vertex of a given graph. We first analyze theoretically how the number and length of the shortest paths between any pair of two vertices are affected by an edge insertion. We then design a fast algorithm for solving the problem mentioned above, by using the theoretical results. We finally examine the efficiency of the proposed algorithm by some experiments on random graphs and scale-free graphs.
Keyword (in Japanese) (See Japanese page) 
(in English) complex network / betweenness centrality / robustness / edge insertion / / / /  
Reference Info. IEICE Tech. Rep., vol. 116, no. 215, NLP2016-56, pp. 63-68, Sept. 2016.
Paper # NLP2016-56 
Date of Issue 2016-09-07 (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 NLP2016-56

Conference Information
Committee NLP  
Conference Date 2016-09-14 - 2016-09-15 
Place (in Japanese) (See Japanese page) 
Place (in English) Konan Univ. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To NLP 
Conference Code 2016-09-NLP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Fast Method for Finding the Edge to be Inserted to Minimize Betweenness Centrality of a Specified Vertex 
Sub Title (in English)  
Keyword(1) complex network  
Keyword(2) betweenness centrality  
Keyword(3) robustness  
Keyword(4) edge insertion  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Toshiyuki Namba  
1st Author's Affiliation Okayama University (Okayama Univ.)
2nd Author's Name Tatsuki Kohno  
2nd Author's Affiliation Okayama University (Okayama Univ.)
3rd Author's Name Norikazu Takahashi  
3rd Author's Affiliation Okayama University (Okayama 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 ()
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 2016-09-15 11:05:00 
Presentation Time 25 minutes 
Registration for NLP 
Paper # NLP2016-56 
Volume (vol) vol.116 
Number (no) no.215 
Page pp.63-68 
#Pages 6 
Date of Issue 2016-09-07 (NLP) 

[Return to Top Page]

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