*robots and Foundation ) ; Foundation , Foundation and Empire , Second
Foundation , Foundation's Edge ( the “ Foundation ” series - the first three known
as the trilogy ) ; Foundation and Earth ( further mixture of robots and Foundation )
.*

**Author**: Paul Levinson

**Publisher:** Psychology Press

**ISBN:** 9780415197724

**Category:** Science

**Page:** 257

**View:** 296

*Example 1 : Basic edges and basic graph The directed graph G = ( V ; R ) shown
below has four basic edges and four ... An edge set T ( x , y ) = R is called an
edge cut if removing its edges from the graph G has the effect that y is no longer ...*

**Author**: Peter J. Pahl

**Publisher:** Springer Science & Business Media

**ISBN:** 9783540679950

**Category:** Computers

**Page:** 1008

**View:** 660

*300 nearest edge of the foundation . The length of bolt to be concreted is *

generally 30-40 times the diameter . If the thickness of the foundation member

does not permit this length , a washer and a nut may be provided at the end for

securing ...

**Author**: P. Srinivasulu

**Publisher:** Tata McGraw-Hill Education

**ISBN:** 9780070966116

**Category:** Machinery

**Page:** 236

**View:** 126

*A loop cut is a new edge that runs through a series of edges like the one selected *

in Figure 4.23. ... This is one of the foundations of modeling objects with

subdivision surfaces—controlling the “roundness” of corners by cutting and

sliding edge ...

**Author**: Roland Hess

**Publisher:** Taylor & Francis

**ISBN:** 1136130373

**Category:** Art

**Page:** 416

**View:** 803

*An edge-bisector of a graph is a set of edges whose removing separates the *

graph into two subgraphs of same order, within one. The edge-bisection of a

graph is the cardinality of the smallest edge-bisector. The main purpose of this

paper is ...

**Author**: Mogens Nielsen

**Publisher:** Springer Science & Business Media

**ISBN:** 3540679014

**Category:** Computers

**Page:** 710

**View:** 770

*considers edges in DAG(s) (Steps and edges in DAG(U) (Steps , and for each *

edge (a, b) in either DAG, it decides ... Update-DAG(s, W'(u, 1))) Input: DAG(s),

DAG(11), and flag(s,t),Vt G V. Output: An edge set H after decrease of weight on ...

**Author**: Ersébet Csuhaj-Varjú

**Publisher:** Springer

**ISBN:** 3662444658

**Category:** Computers

**Page:** 640

**View:** 564

*Characters, Places and Terms in the Robot/Empire/Foundation Metaseries
Donald E. Palumbo. 84 86. Gaia-S ... Gaia is able to harness the unevenly
distributed energy of the universe [*

**Foundation's Edge**; Foundation and Earth]. Gaia-S—The ...

**Author**: Donald E. Palumbo

**Publisher:** McFarland

**ISBN:** 0786498234

**Category:** Literary Criticism

**Page:** 196

**View:** 387

*For over thirty years, generation after generation of science fiction readers had
been reading the Foundation novels and ... The result was that in the week of its
publication, *

**Foundation's Edge**appeared in twelfth place on the New York Times ...

**Author**: Isaac Asimov

**Publisher:** Bantam

**ISBN:** 0307573532

**Category:** Biography & Autobiography

**Page:** 592

**View:** 364

*One important restricted case is unit-capacity graphs, where all the edges have a
capacity of 1. ... Note that the 0.5-core is not empty, as the imputation giving each
edge 0.25 has a excess of exactly 0.5 for the coalitions CA and CB, and any ...*

**Author**: Filip Murlak

**Publisher:** Springer Science & Business Media

**ISBN:** 3642229921

**Category:** Computers

**Page:** 618

**View:** 652

*In a bipartite graph, the vertices can be divided into two sets such that all the
edges in the graph have one vertex in one set and another vertex ... A weight on
such an edge could represent the goodness of fit or perhaps the cost of the
resource.*

**Author**: Srinivasan Keshav

**Publisher:** Addison-Wesley

**ISBN:** 0132826135

**Category:** Computers

**Page:** 491

**View:** 698

*Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree⋆
Davide Bil`o1, Luciano Gual`a2, and ... Given an n-node, undirected and 2-edge-
connected graph G = (V,E) with positive real weights on its m edges, given a set
of k ...*

**Author**: Petr Hlineny

**Publisher:** Springer Science & Business Media

**ISBN:** 364215154X

**Category:** Computers

**Page:** 714

**View:** 969

*(a) (b) d = thickness b = le n g th 2 b = width 3 x = x 2 x = z 1 x = y 3 Di-xx Ro-zz
Ro-xx Ro-yy Se-zz Di-yy edge A edge D ... shallow foundations, and drilled shafts
(for which the tip load-displacement relations were measured) was assembled.*

**Author**:

**Publisher:** Transportation Research Board

**ISBN:** 0309154677

**Category:** Bridges

**Page:** 139

**View:** 449

*For L = 2 , Tedges ( t ) will be a set of edges outgoing from the tail state t of one of
the edges of state s . However , in general , Tedges ( t ) will be the set of edges
going out of a tail state of some edge outgoing from state s ' , where s ' is a ...*

**Author**:

**Publisher:** Pearson Education India

**ISBN:** 9788131707951

**Category:** Computer software

**Page:** 689

**View:** 405

**Foundation's Edge** At last, the costly and bitter war between the two Foundations

has come to an end. The scientists of the First Foundation have proved victorious;

and now they return to Hari Seldon's long-established plan to build ...

**Author**: Isaac Asimov

**Publisher:** Spectra

**ISBN:** 055390096X

**Category:** Fiction

**Page:** 384

**View:** 543

*... 2001 Proceedings Mathematical Foundations of Computer Science (26 : 2001 :
Mariánské Lázně), Jiri Sgall, Ales Pultr ... A vertex coloring of H is proper if each
C–edge contains two vertices with the same color and each D–edge contains ...*

**Author**: Jiri Sgall

**Publisher:** Springer Science & Business Media

**ISBN:** 3540424962

**Category:** Computers

**Page:** 716

**View:** 695

*There are 3 vertices of degree 2 in G. Therefore, all the edges incident on the
vertices d1 e andfmust be included in any ... Now consider the vertex b: when we
include the edge {b, e} in the cycle, there are two edges, namely, {a, b} and {b, c}
of ...*

**Author**: G. Shankar Rao

**Publisher:** I. K. International Pvt Ltd

**ISBN:** 8188237493

**Category:** Computer science

**Page:** 472

**View:** 184