|
Reachability on Marked Graphs
M. A .Comeau and K. Thulasiraman, “Structure of the Submarking Reachability Problem and Network Programming”, IEEE Transactions on Circuits and Systems, Vol. CAS-35, Jan. 1988, pp. 89-100. See also K. Thulasiraman and M. A. Comeau, “Structure of the Submarking Reachability Problem and Network Programming”, Proc. IEEE Intl. Symp. on Circuits and Systems, Philadelphia, May 1987.
K. Thulasiraman and M. A. Comeau, “Structure of a Reachability Problem for (0,1) Capacitated Marked Graphs”, IEEE Trans. on Circuits and Systems, Vol. CAS-34, April 1987, pp. 430-431.
K. Thulasiraman and M. A. Comeau, “Maximum-Weight Markings in Marked Graphs: Algorithms and Interpretations Based on the Simplex Method”, IEEE Trans. on Circuits and Systems, Vol. CAS-34, December 1987, pp. 1535-1545.Also see IEEE International Symposium on Circuits and Systems, Kyoto, Japan, June 1985.
M. A. Comeau and K. Thulasiraman, “Algorithms on Marked Directed Graphs”, Canadian Electrical Engg. Journal, Vol. 9, 1984, pp. 72-79. Also see Proc. IEEE Intl. Symp. on Circuits and Systems, Newport Beach, May 1983.