And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6886497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | And/or-convexity: a graph convexity based on processes and deadlock models |
scientific article; zbMATH DE number 6886497 |
Statements
And/or-convexity: a graph convexity based on processes and deadlock models (English)
0 references
12 June 2018
0 references
graph convexity
0 references
deadlock
0 references
AND-OR model
0 references
and/or graphs
0 references
0.7598945498466492
0 references
0.756348192691803
0 references
0.7114874720573425
0 references
0.7100241184234619
0 references
0.7091626524925232
0 references
