### TABLE I CONNECTION CONSTRAINTS FOR SCHEMAS

2005

Cited by 8

### Table 1: Constraints Produced by the WHILE Connective

### Table 1: Constraints Produced by the WHILE Connective

### Table 3. Closure of Dependence Constraints for Strongly Connected Component

### Table III PBCSP APPLICATION CHARACTERISTICS Vars. Density Constraints Edges Connectivity

### Table 1: Specializations of Network Design Problems with Connectivity Constraints

1999

"... In PAGE 6: ... In this application each node v in the graph has a connectivity requirement r and the connectivity require- ments between nodes s and t are given by rt = min{r, rt}. Table1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table 1 are worth making.... In PAGE 6: ... Table 1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table1 are worth making. The k-edge dis- joint path problem seeks, at minimum cost, k-edge disjoint paths between specified nodes s and t.... In PAGE 8: ...s a unitary NDC problem. Otherwise, it is a nonunitary NDC problem. For example, the SND problem is a unitary NDC problem, while the general Steiner forest problem is a nonunitary NDC problem. The examples in Table1 show that the NDC problem models a very wide variety of con- nectivity problems on graphs. These problems appear both as stand alone problems and as subproblems in more complex network design applications (like VLSI design and telecom- munications network design and management).... ..."

Cited by 6

### Table 1: Specializations of Network Design Problems with Connectivity Constraints

1999

"... In PAGE 2: ... In this application each node v in the graph has a connectivity requirement rv and the connectivity requirements be- tween nodes s and t are given by rst = minfrs; rtg. Table1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table 1 are worth making.... In PAGE 2: ... Table 1 shows several other noteworthy cases of the NDC problem. A few observations concerning the entries in Table1 are worth making. The k-edge dis- joint path problem seeks, at minimum cost, k-edge disjoint paths between specified nodes s and t.... In PAGE 4: ...s a unitary NDC problem. Otherwise, it is a nonunitary NDC problem. For example, the SND problem is a unitary NDC problem, while the general Steiner forest problem is a nonunitary NDC problem. The examples in Table1 show that the NDC problem models a very wide variety of con- nectivity problems on graphs. These problems appear both as stand alone problems and as subproblems in more complex network design applications (like VLSI design and telecom- munications network design and management).... ..."

Cited by 6

### Table 3 Constraints to Zero Pronouns and their referent with Connecting Words

### Table 3.1: Transitive Closure of Dependence Constraints for Strongly Connected Compo- nent of Figure 2.7

1991

### Table 18: Comparing locally connected nets without and with symmetry constraints.

"... In PAGE 66: ...3.3, in the fully connected net (Test 17 and Table 17), the lo- cally connected net (Test 18 and Table18 ) and the wavelet nets (Test 19... ..."