Graph algorithm

Even, S., Graph Algorithms. Computer Science Press, Rockville, MD, 1979. 

The standard way of describing the topology or 2-D structure of a molecule is by a labeled graph. Not surprisingly, graph algorithms play an important role in chemistry and are... 

Recently, we proposed the Multi-objective Evolutionary Graph Algorithm (MEGA), an optimization algorithm designed for the evolution of chemical structures satisfying multiple constraints... 

Tarjan, R. E. Depth-first search and linear graph algorithms. SIAM Journal of the ACM 1972, 22, 146-160. 

From all of these, we have the final graph as shown in Fig. 3 (b) that makes it possible to still apply the graph algorithm like CS2 (Goldberg, 1997). Consequently, we can solve the extensively expanded problem extremely fast compared with the linear programs. 

In SMB [Anan and Avigdor 2008], the output of a weak similarity measure (called first-line matcher) is combined with a decision maker (or second-line matcher) to discover correspondences. The combination strategy depends on the decision maker, which can be Maximum Weighted Bipartite Graph algorithm, Stable Marriage, etc. 

Figure 17 is a graph showing the relationships between compounds of Table 4, computed using the minimal order graph algorithm [2.e] computed in turn from euclidean distances. 

Tarjan RE. Graph algorithms in chemical computation. Algorithms for Chemical Computations. Washington, DC American Chemical Society, 1977 1-20. 

Taijan, R.E. Graph Algorithms in Chemical Computation . In Algorithms for Chemical Computations , Christoffersen, R.E. Ed ACS Symposium Series 46. American Chemical Society Washington, 1977 pp. 1-19. 

Many operations on Boolean functions can be implemented by simple graph algorithms that work recursively on their BDD representation in a conventional depth-first fashion. For example if f and g are Boolean functions represented by BDDs, if x, is one of their variables and if op is a generic binary operator, we express f op g as ... 

Hybrid graph algorithms, p BMD, dynamic reordering, decision diagrams IFIP 1997. Published Chapman Hall... 

L. Goldberg. Efficient algorithms for listing unlabeled graphs.]. Algorithms, 13 128-143,... 

The formal definitions enable us to classify the variables by graph algorithms. Basically, the classification algorithms consist in eliminating circuits containing unmeasured streams see for instance Mah (1990), 8-2-2 and 9-1-1. As an example, let us outline a procedure that performs the classification simultaneously with transforming the equations in a manner suitable for adjustment (reconciliation) of measured variables, and computation of the unmeasured observable ones. 

Kjffirul, U. Triangulation of graphs - Algorithms giving small total state space. Technical Report R 90-09, University of Aalborg, Denmark (1990)... 

---