 | Gena Hahn, Gert Sabidussi, Robert Woodrow - Mathematics - 1989 - 282 pages
...a configuration (1) and is hamiltonian or A, B, and C have cardinality at least 2 and the only arcs from A to B, from B to C and from C to A are respectively (a,-,&;), (6,-,c,-) and (c,-,a,-) for « = 1,2. Let us assume that we are in this... | |
 | Pierre Bourdieu, Jean-Claude Chamboredon, Jean-Claude Passeron - Sociology - 1991 - 296 pages
...terms of this model, then, the process of embourgeoisement takes the form of a threefold movement: from (A) to (B), from (B) to (C), and from (C) to (D). Through using a model of this kind it thus becomes possible to reduce the thesis of embourgeoisement... | |
 | Daniel J. Velleman - Computers - 1994 - 324 pages
...(a, d) because (a, b), (b, c), and (c, d) were all elements of B. In other words, you could go by bus from a to b, from b to c, and from c to d. In fact, it should be clear now that for any two cities x and y, if there is a way to get from x... | |
 | Ronald L. Graham, Martin Grotschel, Martin Grötschel, László Lovász - Computers - 2003 - 1130 pages
...called terminals. The three-terminal problem consists of finding (altogether three) arc-disjoint paths from a to b, from b to c and from c to a. Clearly, this is a special case of the three arc-disjoint paths problem but Ibaraki and Poljak observed... | |
 | L. Douglas Kiel, Euel W. Elliott - Business & Economics - 1997 - 364 pages
...are such that no equilibrium exists, then the majority-rule social choice function creates a mapping from a to b, from b to c, and from c to a. As in the example of the logistic function, the existence of regions that feed back into previous regions... | |
 | John Scott - Class consciousness - 1996 - 446 pages
...terms of this model, then, the process of embourgeoisement takes the form of a threefold movement: from (A) to (B), from (B) to (C), and from (C) to (D). Through using a model of this kind it thus becomes possible to reduce the thesis of embourgeoisement... | |
 | J. D. Lamb, Donald Arthur Preece - Mathematics - 1999 - 312 pages
...construct a tournament T by first taking three pairwise disjoint vertex sets A, B, C and adding all arcs from A to B, from B to C, and from C to A. The remaining arcs are added at random. If A, B,C are large, then T is highly connected. Let F be the... | |
 | William P. Berlinghoff, Kerry E. Grant, Dale Skrien - Mathematics - 2001 - 672 pages
...each city to be visited more than once? (Hint: Consider three cities A, B, and C such that the lengths from A to B, from B to C, and from C to A are all - 10. One route is ABCA. But ABCABCA is shorter. Is there a shortest route?) Suppose that you... | |
 | Steve Featherstone - Sports & Recreation - 2004 - 196 pages
...route that is comprised of waypoints A, B, C and D would contain three legs. The route legs would be from A to B, from B to C and from C to D. Line-Of -Sight (LOS) Propagation The Achilles heel of GPS receivers is their dependence on line-of-sight... | |
| |
E to A, from A to B, from B to C, and from C to... 
