The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 논문은 그리드 그래프에서 최단 경로 기반의 트리 내(in-tree)를 다루고 있습니다. 루트는 모든 정점 사이에서 이동해야 합니다. 이러한 스패닝 이동성 패턴으로서 해밀턴 경로 또는 주기를 기반으로 하는 루트 궤적이 논의됩니다. 이러한 궤적을 따라 각 정점은 루트까지의 최단 경로에서 다음 홉을 무작위로 선택합니다. 이러한 가정 하에서 이 논문은 S-경로라고 불리는 루트 궤적이 최소 예상 대칭 차이를 제공한다는 것을 보여줍니다. 수치 실험에서는 Right-cycle이라는 또 다른 궤적도 최소 결과를 제공한다는 것을 보여줍니다.
Yoshihiro KANEKO
Gifu University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Yoshihiro KANEKO, "The Expected Distance of Shortest Path-Based In-Trees along Spanning Root Mobility on Grid Graph" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 9, pp. 1071-1077, September 2020, doi: 10.1587/transfun.2019KEP0003.
Abstract: The paper deals with the shortest path-based in-trees on a grid graph. There a root is supposed to move among all vertices. As such a spanning mobility pattern, root trajectories based on a Hamilton path or cycle are discussed. Along such a trajectory, each vertex randomly selects the next hop on the shortest path to the root. Under those assumptions, this paper shows that a root trajectory termed an S-path provides the minimum expected symmetric difference. Numerical experiments show that another trajectory termed a Right-cycle also provides the minimum result.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019KEP0003/_p
부
@ARTICLE{e103-a_9_1071,
author={Yoshihiro KANEKO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Expected Distance of Shortest Path-Based In-Trees along Spanning Root Mobility on Grid Graph},
year={2020},
volume={E103-A},
number={9},
pages={1071-1077},
abstract={The paper deals with the shortest path-based in-trees on a grid graph. There a root is supposed to move among all vertices. As such a spanning mobility pattern, root trajectories based on a Hamilton path or cycle are discussed. Along such a trajectory, each vertex randomly selects the next hop on the shortest path to the root. Under those assumptions, this paper shows that a root trajectory termed an S-path provides the minimum expected symmetric difference. Numerical experiments show that another trajectory termed a Right-cycle also provides the minimum result.},
keywords={},
doi={10.1587/transfun.2019KEP0003},
ISSN={1745-1337},
month={September},}
부
TY - JOUR
TI - The Expected Distance of Shortest Path-Based In-Trees along Spanning Root Mobility on Grid Graph
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1071
EP - 1077
AU - Yoshihiro KANEKO
PY - 2020
DO - 10.1587/transfun.2019KEP0003
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2020
AB - The paper deals with the shortest path-based in-trees on a grid graph. There a root is supposed to move among all vertices. As such a spanning mobility pattern, root trajectories based on a Hamilton path or cycle are discussed. Along such a trajectory, each vertex randomly selects the next hop on the shortest path to the root. Under those assumptions, this paper shows that a root trajectory termed an S-path provides the minimum expected symmetric difference. Numerical experiments show that another trajectory termed a Right-cycle also provides the minimum result.
ER -