Process graph
In graph theory a process-graph or P-graph is a directed bipartite graph used in workflow modeling. The vertices of the graph are of two types, operation (O) and material (M). The two vertex types form two disjunctive sets. The edges of the graph link the O and M vertices. An edge from an operation vertex (O) connects to a material vertex (M) if M is the output of O, such as a 'document' (material) that is output by a 'write-up' (operation). An edge from M to O indicates that M is an element of the input set of O, e.g. a document may be part of the input to a 'review' operation.
Wikipage redirect
primaryTopic
Process graph
In graph theory a process-graph or P-graph is a directed bipartite graph used in workflow modeling. The vertices of the graph are of two types, operation (O) and material (M). The two vertex types form two disjunctive sets. The edges of the graph link the O and M vertices. An edge from an operation vertex (O) connects to a material vertex (M) if M is the output of O, such as a 'document' (material) that is output by a 'write-up' (operation). An edge from M to O indicates that M is an element of the input set of O, e.g. a document may be part of the input to a 'review' operation.
has abstract
In graph theory a process-grap ...... input to a 'review' operation.
@en
Link from a Wikipage to an external page
Wikipage page ID
27,487,973
Wikipage revision ID
718,572,739
subject
hypernym
type
comment
In graph theory a process-grap ...... input to a 'review' operation.
@en
label
Process graph
@en