A Self-Stabilizing Algorithm for Constructing a Maximal (1,1)-Directed Acyclic Mixed Graph-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Self-Stabilizing Algorithm for Constructing a Maximal (1,1)-Directed Acyclic Mixed Graph

Published:2018 Issue:1 Volume:8 Page:53-72
ISSN:2185-2839
Container-title:International Journal of Networking and Computing
language:en
Short-container-title:IJNC

Author:

Kim Yonghwan¹,Ohno Haruka,Katayama Yoshiaki¹,Masuzawa Toshimitsu²

Affiliation:

1. Nagoya Institute of Technology

2. Osaka University

Publisher

IJNC Editorial Committee

Link

https://www.jstage.jst.go.jp/article/ijnc/8/1/8_53/_pdf

Reference2 articles.

1. [4] J.E. Burns. Self-stabilizing rings without daemons. Technical Report GIT-ICS-87/36, Georgia Tech, 1987.

2. [5] Shlomi Dolev. Self-Stabilization. MIT Press, 2000.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets;Theoretical Computer Science;2021-05

2. A self‐stabilizing algorithm for constructing a maximal ( σ , τ )‐directed acyclic mixed graph;Concurrency and Computation: Practice and Experience;2020-05-05

3. Brief Announcement: Self-stabilizing Construction of a Minimal Weakly $$\mathcal {ST}$$-Reachable Directed Acyclic Graph;Lecture Notes in Computer Science;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP