IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2019-11-28 13:50
The expected distance sum of random shortest-path in-trees over Hamilton path trajectory on grid graph
Yoshihiro Kaneko (Gifu Univ.) CAS2019-50 MSS2019-29
Abstract (in Japanese) (See Japanese page) 
(in English) The paper deals with shortest path-based in-trees on a grid graph. There root moves among all vertices. As such root mobility pattern, four Hamilton paths are compared. Suppose that each vertex randomly selects the next hop on the shortest path to root. Then S-type root mobility turns out to provide the minimum expected distance sum, followed by numerical experiments.
Keyword (in Japanese) (See Japanese page) 
(in English) grid graph / shortest path-based in-tree / distance / Hamilton path / / / /  
Reference Info. IEICE Tech. Rep., vol. 119, no. 313, CAS2019-50, pp. 33-38, Nov. 2019.
Paper # CAS2019-50 
Date of Issue 2019-11-21 (CAS, MSS) 
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. (No. 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF CAS2019-50 MSS2019-29

Conference Information
Committee CAS MSS IPSJ-AL  
Conference Date 2019-11-28 - 2019-11-29 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To CAS 
Conference Code 2019-11-CAS-MSS-AL 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) The expected distance sum of random shortest-path in-trees over Hamilton path trajectory on grid graph 
Sub Title (in English)  
Keyword(1) grid graph  
Keyword(2) shortest path-based in-tree  
Keyword(3) distance  
Keyword(4) Hamilton path  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yoshihiro Kaneko  
1st Author's Affiliation Gifu University (Gifu Univ.)
2nd Author's Name  
2nd Author's Affiliation ()
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
Date Time 2019-11-28 13:50:00 
Presentation Time 25 
Registration for CAS 
Paper # IEICE-CAS2019-50,IEICE-MSS2019-29 
Volume (vol) IEICE-119 
Number (no) no.313(CAS), no.314(MSS) 
Page pp.33-38 
#Pages IEICE-6 
Date of Issue IEICE-CAS-2019-11-21,IEICE-MSS-2019-11-21 


[Return to Top Page]

[Return to IEICE Web Page]


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