Circuits and Systems Letters Structure of the Reachability Problem for (0, l)-Capacitated Marked Graphs
by
K. Thulasiraman
,
M. A. Comeau
BibTeX
@MISC{Thulasiraman_circuitsand,
author = {K. Thulasiraman and M. A. Comeau},
title = {Circuits and Systems Letters Structure of the Reachability Problem for (0, l)-Capacitated Marked Graphs},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
M~ract-The structure of the reachability problem for (O,l)-capaci-tated marked graphs is studied. A purely graph-theoretic characterization of this problem is presented. I.
Citations
| 110 | Distributed algorithms for generating loop-free routes in networks with frequently changing topology - Gafni, Bertsekas - 1981 |
| 101 | Marked directed graphs - Commoner, Holt, et al. - 1971 |
| 13 | Circuit theoretic analysis and synthesis of marked graphs - Murata - 1977 |
| 1 | Similarity of graphs n - Wiley-Inters&xxx - 1981 |
| 1 | and enumeration of dissimilar n th order symmetric patterns - J - 1987 |
