### Table 1 Graph-Based Process Configuration Measures

2002

"... In PAGE 17: ...A sample of graph-based process configuration measures and values is presented in Table1 . The measurements listed under the Process A label are obtained from the example representation presented in Figure 4 above.... In PAGE 22: ... This latter inference represents the kind obtainable only through a ratio scale. A BCD A BC Process A Process C Figure 7 Processes as Standard Sequences To generalize, we can apply the extensive-measurement procedure to the other graph-based measures defined in Table1 as well. For instance, returning to the two directed graphs presented in Figure 7, say we measure a graph-based representation for Process A and obtain a measured value of four for process size.... In PAGE 23: ... As above, we note this is exactly the kind of analysis used to determine the measure mass, used extensively in the physical sciences, which supports a ratio scale. And again, this extensive-measurement approach can be applied to any of the graph-based measures defined in Table1 , in addition to other measures based on like graph-theoretic concepts (e.g.... ..."

### Table 1. Graph-based modeling approaches.

2007

"... In PAGE 4: ... A transition links any two nodes (task or coordinator) and is represented by a directed arc. Table1 provides a list of representative graph-based modeling approaches. Table 1.... ..."

Cited by 1

### Table 9 Example Process Measures Measure Graph-Based Definition

"... In PAGE 43: ... to support comparative process analysis). A set of example process measures is presented in Table9 , along with their corresponding graph- based definitions. Table 9 Example Process Measures Measure Graph-Based Definition... ..."

### Table 1. Comparison over GraphBase directed graphs.

2005

"... In PAGE 4: ... The first set comes from [8]. The graphs are characterized by their probability (eta = 0:01 is noted r001 in Table1 ) that an edge is present between two distinct node n and n0. Those graphs were used to evaluate vflib algorithm performance [7].... In PAGE 4: ... Experiments show that CSP approach for subgraph matching solves more problem within a time limit against C++ specialized checking-based methods [7]. Table1 and 2 show the percentage of instances solved within a time limit of 5 minutes, for directed and undirected instances. Single specialized propagator MCPA for forbidden edges is more efficient than the version with two propagators.... ..."

Cited by 5

### Table 2. Comparison over GraphBase directed graphs.

### Table 3. Comparison over GraphBase undirected graphs.

### Table 2. Performance of graph-based propagation approach.

2007

Cited by 1

### Table 1: Comparison over GraphBase undirected graphs. All solutions 5 min.

2006

"... In PAGE 6: ...) are posted, and finally the full variable symmetry (FVS) that breaks all variable symmetries. Results are shown in Table1 and 2. In those runs, the prepro- cessing time has not been considered.... ..."

Cited by 2