Optimum Set of Paths which Pass All Arcs of a Graph

Hiroshi MASUYAMA; Tetsuo ICHIMORI

Copy

Hiroshi MASUYAMA, Tetsuo ICHIMORI, "Optimum Set of Paths which Pass All Arcs of a Graph" in IEICE TRANSACTIONS on transactions, vol. E69-E, no. 1, pp. 6-8, January 1986, doi: .
Abstract: Some properties of an optimum set of paths which pass all arcs of a graph are presented. It is shown that the unique existence of the optimum set depends on the configuration of a graph. The set is of use as the minimum set of test cases to the path test.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e69-e_1_6/_p

Copy

@ARTICLE{e69-e_1_6,
author={Hiroshi MASUYAMA, Tetsuo ICHIMORI, },
journal={IEICE TRANSACTIONS on transactions},
title={Optimum Set of Paths which Pass All Arcs of a Graph},
year={1986},
volume={E69-E},
number={1},
pages={6-8},
abstract={Some properties of an optimum set of paths which pass all arcs of a graph are presented. It is shown that the unique existence of the optimum set depends on the configuration of a graph. The set is of use as the minimum set of test cases to the path test.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Optimum Set of Paths which Pass All Arcs of a Graph
T2 - IEICE TRANSACTIONS on transactions
SP - 6
EP - 8
AU - Hiroshi MASUYAMA
AU - Tetsuo ICHIMORI
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 1
JA - IEICE TRANSACTIONS on transactions
Y1 - January 1986
AB - Some properties of an optimum set of paths which pass all arcs of a graph are presented. It is shown that the unique existence of the optimum set depends on the configuration of a graph. The set is of use as the minimum set of test cases to the path test.
ER -