Prabhaker Mateti and Narsingh Deo. On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing, 5(1):90--99, March 1976.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....we have the constraint that Delay(c) II Distance(c) 0. This is the constraint upon the II imposed by this one recurrence circuit. The RecMII is determined by considering the worst case constraint across all circuits. One approach is to enumerate all the elementary circuits in the graph [40, 26] as was done in the Cydra 5 compiler, calculate the smallest value of II that satisfies the above inequality for that circuit, and to use the largest such value across all circuits. The second approach, the one used in this study, is to pose the problem as a minimal cost to time ratio cycle ....

Mateti, P., and Deo, N. On algorithms for enumerating all circuits of a graph. SIAM Journal of Computing 5, 1 (1976), 90-99.

....is implemented in the tool mentioned in the first paragraph. Resolve all approaches [10, 21, 31] offer the designer an edge listthatremovesall of the positive cycles from G. These approaches first find all the simple cycles (those that do not contain other cycles) using one of the algorithms in [24], and then visit and resolve each positive cycle. The total worst case time complexity is exponential (O#p#n#m##) Resolve some approaches [4, 8, 14, 17, 20] offer the designer an edge list that removes some of the positive cycles from G.The edge list is found in polynomial time. The designer ....

MATETI,P.,AND DEO, N. On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 5, 1 (Mar. 1976), 90--8.

.... (edge) redundant graph, there exists a pair of node (edge) disjoint paths, that can be used for APS, between any two nodes is a consequence of Menger s theorem [44, 31] There have been a variety of proposed path rerouting schemes based on Menger s theorem, e.g. SNCP and different variants of it [2, 39, 45, 59, 53, 27]. Automatic protection switching over arbitrary redundant networks need not restrict itself to two paths between every pair of nodes, but can instead be performed with trees, which are more bandwidth efficient for multicast traffic [29, 11, 52, 18] For loopback protection, most of the schemes ....

P. Mateti, N. Deo, "On Algorithms for Enumerating All Circuits of a Graph", SIAM J. Comput., vol. 5, no. 1, March 1976.

....an on cycle relationship) It is two if both of failure span j s end nodes are on the cycle, but span j itself is not part of cycle i (i.e. a straddling relationship) Figure 4 illustrates these relationships. Programs were written both to find the set of all cycles with which to populate (see [42] to find all cycles of a graph) and, for each cycle i, to determine the span consumption and restoration relationships of prospective cycle i, to each possible span failure j, by inspection. With and corresponding matrices for and the IP tableau can be generated for solution with a large scale ....

P. Mateti and N. Deo, "On algorithms for enumerating all circuits of a graph," SIAM J. Comput., vol. 5, no. 1, Mar. 1976, pp. 90-99.

....bound on the initiation interval is then II = max(II dep ; II res ) which is four for this example. Any cycle having min=dif equal to II is termed a critical cycle. 1.6 Methods of Computing II 1.6. 1 Enumeration of Cycles One method of estimating II dep simply enumerates all the simple cycles [35, 52]. The maximum min dif for all cycles is then the II dep [15] 1.6.2 Shortest Path Algorithm Another method for estimating II dep uses transitive closure of a graph. The transitive closure of a graph is a reachability relationship. If the dependence constraints are expressed as a function of II ....

P. Mateti and N. Deo. On Algorithms for Enumerating All Circuits of a Graph. SIAM Journal of Computing, 5(1):990--99, 1976.

....G C over the set of edges E is called a cycle graph of G with respect to C. See [ST81, BM76] for more on definitions and terminology. There are several problems which depend on finding a certain cycle (see [DG76] and [Sys79] a subset of cycles (see [HS75] and all cycles of a graph (see [MD76] which can be solved using the cycle space methods. A time optimal backtrack algorithm for enumerating all cycles of a graph is presented in [MD76] All the known backtrack algorithms for this problem use depth first search and therefore, are very hard to parallelize on real machines such as ....

....several problems which depend on finding a certain cycle (see [DG76] and [Sys79] a subset of cycles (see [HS75] and all cycles of a graph (see [MD76] which can be solved using the cycle space methods. A time optimal backtrack algorithm for enumerating all cycles of a graph is presented in [MD76] All the known backtrack algorithms for this problem use depth first search and therefore, are very hard to parallelize on real machines such as mesh connected computers. The straightforward cycle vector space method of finding a cycle basis of the given graph and then determining all the cycles ....

P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Computing, 5(1):90--99, 1976.

....the interior region numbered 1 is exponential in r = n=2 1 since we can choose any combination of the remaining regions to make up a cycle. There are several problems which depend on finding a certain cycle (see [2] and [11] a subset of cycles (see [4] and all cycles of a graph (see [6]) which can be solved using the cycle space methods. A time optimal backtrack algorithm for enumerating all cycles of a graph is presented in [6] All the known backtrack algorithms for this problem use depth first search and therefore, are very hard to parallize on real machines such as ....

....There are several problems which depend on finding a certain cycle (see [2] and [11] a subset of cycles (see [4] and all cycles of a graph (see [6] which can be solved using the cycle space methods. A time optimal backtrack algorithm for enumerating all cycles of a graph is presented in [6]. All the known backtrack algorithms for this problem use depth first search and therefore, are very hard to parallize on real machines such as mesh connected computers. The straightforward cycle vector space method of finding a cycle basis of the given graph and then determining all the cycles by ....

P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Computing, 5(1):90--99, 1976.

....space (denoted by C) consists in finding a fundamental basis associated with a spanning tree 2 [Kirchhoff, 1847] Many papers deal with fundamental basis search [Welch, 1966; Paton, 1969; Gibbs, 1969] Most of them use this notion to list all elementary cycles of a graph. Unfortunately, as [Mateti and Deo, 1975] have shown, such a method can generate 2 vectors few of which actually correspond to elementary cycles. Read and Tarjan, 1975] solve this problem using a search algorithm which needs O(n m nc) operations, where c is the number of elementary cycles. For planar graphs, Syslo, 1981] has shown ....

P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Comput., 5:90--101, 1975.

....presented earlier. Cycles in the graph are identified and then analyzed for a deadlock sufficiency condition. If a deadlock is indicated, reserved buffer space is judiciously applied to eliminate the deadlock. In general, this work suffers from the complexity involved in cycle enumeration, see Mateti and Deo (1976). Required computation becomes intractable as system size increases. Leung and Sheen (1993) discuss a detection and recovery approach which maintains a single unit of free buffer capacity in a central storage area. The detection algorithm checks to see if all machines are blocked simultaneously. ....

Mateti, P. and Deo, N., "On Algorithms for Enumerating All Circuits of a Graph" SIAM Journal of Computing, Vol. 5, No. 1, pp. 90-99, (1976).

....graph G C over the set of edges E is called a cycle graph of G with respect to C. See [26, 2] for more on definitions and terminology. There are several problems which depend on finding a certain cycle (see [5] and [27] a subset of cycles (see [10] and all cycles of a graph (see [18]) which can be solved using the cycle space methods. A time optimal backtrack algorithm for enumerating all cycles of a graph is presented in [18] All the known backtrack algorithms for this problem use depth first search and therefore, are very hard to parallize on real machines such as ....

....There are several problems which depend on finding a certain cycle (see [5] and [27] a subset of cycles (see [10] and all cycles of a graph (see [18] which can be solved using the cycle space methods. A time optimal backtrack algorithm for enumerating all cycles of a graph is presented in [18]. All the known backtrack algorithms for this problem use depth first search and therefore, are very hard to parallize on real machines such as mesh connected computers. The straightforward cycle vector space method of finding a cycle basis of the given graph and then determining all the cycles by ....

P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Computing, 5(1):90--99, 1976.

No context found.

Prabhaker Mateti and Narsingh Deo. On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing, 5(1):90--99, March 1976.

No context found.

Prabhaker Mateti and Narsingh Deo. On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing, 5(1):90--99, March 1976.

No context found.

P. Mateti and N. Deo, "On algorithms for enumerating all circuits of a graph," SIAM Journal of Computing, vol. 5, pp. 90-- 99, Mar. 1976.

No context found.

P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Comput., 5:90--99, 1976.

No context found.

P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. volume 5, March 1976.

No context found.

P. Mateti and N. Deo, "On algorithms for enumerating all circuits of a graph," SIAM J. Comput., vol. 5, no. 1, Mar. 1976.

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