✦ LIBER ✦

Marking Optimization of Weighted Marked Graphs

✍ Scribed by Nathalie Sauer

Book ID: 111538845
Publisher: Springer
Year: 2003
Tongue: English
Weight: 242 KB
Volume: 13
Category: Article
ISSN: 0924-6703
DOI: 10.1023/a:1024055724914

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quantitative analysis of continuous weig

Quantitative analysis of continuous weighted marked graphs

✍ Redouane Kara; Jean Jacques Loiseau; Said Djennoune 📂 Article 📅 2008 🏛 Elsevier 🌐 English ⚖ 701 KB

Marked directed graphs

✍ F. Commoner; A.W. Holt; S. Even; A. Pnueli 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 670 KB

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

A transformation of marked graphs

✍ W. Henhapl 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 394 KB

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

A characterization of consistent marked

A characterization of consistent marked graphs

✍ 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