Diverse graph structure models for concurrent processing systems have been suggested and used. The structures differ in generality and scope according to the properties one wishes to model and analyze. In this paper we solve a problem of maximal storage requirements for a simple flowchart model call
โฆ LIBER โฆ
A transformation of marked graphs
โ Scribed by W. Henhapl
- Book ID
- 113161728
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 394 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Marked directed graphs
โ
F. Commoner; A.W. Holt; S. Even; A. Pnueli
๐
Article
๐
1971
๐
Elsevier Science
๐
English
โ 670 KB
A characterization of consistent marked
โ
Cornelis Hoede
๐
Article
๐
1992
๐
John Wiley and Sons
๐
English
โ 364 KB
## Abstract A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterzing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterizatio
Scheduling of extended marked graphs
โ
Kenji Onaga
๐
Article
๐
1987
๐
John Wiley and Sons
๐
English
โ 816 KB
Submarking reachability of marked graphs
โ
Kumagai, S.; Kodama, S.; Kitagawa, M.
๐
Article
๐
1984
๐
IEEE
โ 773 KB
Marking Optimization of Weighted Marked
โ
Nathalie Sauer
๐
Article
๐
2003
๐
Springer
๐
English
โ 242 KB
A note on the construction of marked gra
โ
K. Thirusangu; K. Rangarajan
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 318 KB