A Recursive Procedure for Designing Optimal <I>d</I>-Matched Digraphs

Kiyoaki YOSHIDA; Yasumasa SUJAKU; Tohru KOHDA

A Recursive Procedure for Designing Optimal d-Matched Digraphs

Kiyoaki YOSHIDA, Yasumasa SUJAKU, Tohru KOHDA

Full Text Views

0

Share
Cite this

Summary :

We define a d-matched digraph and propose a recursive procedure for designing an optimal d-matched digraph without bidirectional edges. The digraph represents an optimal highly structured system which is a special class of self-diagnosable systems and identifies all of the faulty units independently and locally in O(|E|) time complexity. The procedure is straightforward and gives a system flexible in network connections. Hence the procedure is applicable to real systems such as the Internet or cooperative robotic systems which change their topology dynamically.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.5 pp.1266-1274

Publication Date: 2003/05/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Graphs and Networks

Cite this

Copy

Kiyoaki YOSHIDA, Yasumasa SUJAKU, Tohru KOHDA, "A Recursive Procedure for Designing Optimal d-Matched Digraphs" in IEICE TRANSACTIONS on Fundamentals, vol. E86-A, no. 5, pp. 1266-1274, May 2003, doi: .
Abstract: We define a d-matched digraph and propose a recursive procedure for designing an optimal d-matched digraph without bidirectional edges. The digraph represents an optimal highly structured system which is a special class of self-diagnosable systems and identifies all of the faulty units independently and locally in O(|E|) time complexity. The procedure is straightforward and gives a system flexible in network connections. Hence the procedure is applicable to real systems such as the Internet or cooperative robotic systems which change their topology dynamically.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_5_1266/_p

Copy

@ARTICLE{e86-a_5_1266,
author={Kiyoaki YOSHIDA, Yasumasa SUJAKU, Tohru KOHDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Recursive Procedure for Designing Optimal d-Matched Digraphs},
year={2003},
volume={E86-A},
number={5},
pages={1266-1274},
abstract={We define a d-matched digraph and propose a recursive procedure for designing an optimal d-matched digraph without bidirectional edges. The digraph represents an optimal highly structured system which is a special class of self-diagnosable systems and identifies all of the faulty units independently and locally in O(|E|) time complexity. The procedure is straightforward and gives a system flexible in network connections. Hence the procedure is applicable to real systems such as the Internet or cooperative robotic systems which change their topology dynamically.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - A Recursive Procedure for Designing Optimal d-Matched Digraphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1266
EP - 1274
AU - Kiyoaki YOSHIDA
AU - Yasumasa SUJAKU
AU - Tohru KOHDA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2003
AB - We define a d-matched digraph and propose a recursive procedure for designing an optimal d-matched digraph without bidirectional edges. The digraph represents an optimal highly structured system which is a special class of self-diagnosable systems and identifies all of the faulty units independently and locally in O(|E|) time complexity. The procedure is straightforward and gives a system flexible in network connections. Hence the procedure is applicable to real systems such as the Internet or cooperative robotic systems which change their topology dynamically.
ER -