Chen P., editor. International Conference on Entity-Relationship Approach to Systems Analysis and Design, Amsterdam, 1980. North Holland publishing company. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Diagrammatic Presentation of Software Engineering Documents - Jones (1995) (Correct)
....and the relationships between them. Consequently the diagrammatic techniques used during such modelling are commonly referred to as ER (Entity Relationship) diagrams. RockEvans and Engelien [60] describe sixteen different analytic data model diagrams. A pioneer of such diagrams was Peter Chen [18, 19, 20]. In this section an extension of Chen s technique proposed by Elmasri and Navathe [32] is presented. They refer to the extended entity Modelling Diagrams 11 relationship diagrams as EER (Extended Entity Relationship) diagrams. The extension includes the concepts of subclass superclass ....
Chen P., editor. International Conference on Entity-Relationship Approach to Systems Analysis and Design, Amsterdam, 1980. North Holland publishing company.
On the Inverse Shortest Path Problem - Burton (1993) (2 citations) (Correct)
....systems. Many shortest path oriented models, such as those dedicated to best routing in transport networks, require directed graphs, that is, graphs in which edges have directions. We adopt for the most part the terminology and notation of Deo [29] which are commonly found in the literature (see [25, 26, 30, 63, 64], for instance) A directed graph or digraph consists of a finite set V = fv k g n k=1 of vertices and a set A = fa l g m l=1 of ordered pairs of vertices called arcs, where a l = v s(l) v t(l) with s(l) being the index of the source or initial vertex of the l th arc and t(l) the index of ....
W.-K. Chen, Applied graph theory, North-Holland Publishing Company, 484 pp., 1971.
Stability Radii of Systems With Stochastic Uncertainty and .. - Hinrichsen, Pritchard (1996) Self-citation (Theory) (Correct)
....nevertheless we would like to stress that these proofs are an important part of the overall proof of our main results in x3 x5. The solution of (3) depends strongly on the zero block pattern of the compound matrix H = H ij ) N i;j=1 . To capture this pattern we denote by G the directed graph [3] with node set N = f1; Ng and set of directed arcs A = f(i; j) 2 N 2 ; H ij 6= 0g: G is said to be strongly connected if every node of G is connected to every distinct node of G by a directed path in G. Theorem 2.1 Suppose that G is strongly connected, then there exists a subset J ae ....
....holds in the scalar case ( j = 1; j 2 N) if G is strongly connected. If G is not strongly connected there will not, in general, exist a minimum of f . To deal with this case we introduce the following notation. Let C k ; k = 1; K be the node sets of the strongly connected components [3] of G ordered in such a way that for 1 h k K there is no directed arc (i; j) 2 A such that i 2 C k ; j 2 C h . Then, for all h; k 2 K, h k = i 2 C k and j 2 C h ) H ij = 0) 10) Since N = S k2K C k it follows from (10) that f(ff) max h2K max j2C h fl fl fl fl fl fl N X i=1 ....
W.-K. Chen. Applied Graph Theory. North-Holland Publishing Company, Amsterdam, New York, Oxford, 2nd edition, 1970.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC