Structure of the submarking-reachability problem and network programming
暂无分享,去创建一个
[1] Amir Pnueli,et al. Marked Directed Graphs , 1971, J. Comput. Syst. Sci..
[2] S. Kumagai,et al. Submarking reachability of marked graphs with token capacity constraints , 1984 .
[3] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..
[4] S. Kumagai,et al. Submarking reachability of marked graphs , 1984 .
[5] Tadao Murata,et al. Circuit theoretic analysis and synthesis of marked graphs , 1977 .
[6] Tadao Murata,et al. Structure matrices for petri nets and their applications , 1985 .
[7] T. Murata. State equation, controllability, and maximal matchings of petri nets , 1977 .
[8] R. Karp,et al. Properties of a model for parallel computations: determinacy , 1966 .
[9] Krishnaiyan Thulasiraman,et al. Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method , 1987 .