Let G be a directed graph such that every edge e of G is associated with a positive integer, called the index of e. Then G is called a network graph if, at every vertex v of G, the sum of the indices ...
Journal of the Royal Statistical Society. Series C (Applied Statistics), Vol. 53, No. 2 (2004), pp. 249-260 (12 pages) ...
The presentation will introduce the DACM (Dimensional Analysis Conceptual Modeling) approach as a way to represent an engineering problem in the form of oriented colored graphs. The foundations of the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback