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 2018-05-25 16:20
Optimal partition of a tree with social distance
Masahiro Okubo (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Hirotaka Ono (Nagoya Univ.) COMP2018-3
Abstract (in Japanese) (See Japanese page) 
(in English) Given a graph $G=(V,E)$, a partition ${C_1,C_2, ldots, C_k}$ of $V$ is called a graph partition. We consider a social welfare of a graph partition of $G$ based on distances between vertices in $G$, and define a graph partition with optimal social welfare.
Finding a graph partition with optimal social welfare is known to be NP-hard in general. In this paper, we show that a graph partition with optimal social welfare of a given tree can be computed in $O(Delta^2n)$ time, where $n$ is the number of vertices and $Delta$ is the maximum degree.
Keyword (in Japanese) (See Japanese page) 
(in English) graph algorithm / tree / graph partition / social distance / social welfare / / /  
Reference Info. IEICE Tech. Rep., vol. 118, no. 68, COMP2018-3, pp. 37-44, May 2018.
Paper # COMP2018-3 
Date of Issue 2018-05-18 (COMP) 
ISSN 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 COMP2018-3

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2018-05-25 - 2018-05-26 
Place (in Japanese) (See Japanese page) 
Place (in English) Nagoya Institute of Technology 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2018-05-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Optimal partition of a tree with social distance 
Sub Title (in English)  
Keyword(1) graph algorithm  
Keyword(2) tree  
Keyword(3) graph partition  
Keyword(4) social distance  
Keyword(5) social welfare  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Masahiro Okubo  
1st Author's Affiliation Nagoya University (Nagoya Univ.)
2nd Author's Name Tesshu Hanaka  
2nd Author's Affiliation Thuo University (Chuo Univ.)
3rd Author's Name Hirotaka Ono  
3rd Author's Affiliation Nagoya University (Nagoya 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 2018-05-25 16:20:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2018-3 
Volume (vol) vol.118 
Number (no) no.68 
Page pp.37-44 
#Pages
Date of Issue 2018-05-18 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


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