H. Fleischner. Eulerian Graphs and Related Topics. Elsevier Science Publishers B.V., 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Permutation-Path Coloring Problem on Trees - Dominique Barth Sylvie (2000) (Correct)
....least one path in P having v as ending vertex, and with arc set = f(v; w) v; w 2 V and v w 2 Pg. A digraph G = V; A) is said pseudo symmetric, if for any vertex v 2 V , d (v) d (v) where d (v) resp. d (v) denotes the in degree (resp. out degree) of vertex v. Theorem 1 [11] If G is a connected pseudo symmetric digraph, then G is Eulerian and an Eulerian circuit of G can be found in linear time. Let P n denotes the directed symmetric path graph on n vertices. Let ST(n) denotes the directed symmetric star graph on n vertices (i.e. the tree having only one internal ....
H. Fleischner. Eulerian graphs and related topics. Annals of Discrete Mathematics, no. 45, vol. 2, Elsevier Science Publisher B.V., 1991.
The Permutation-Path Coloring Problem on Trees - Corteel, Valencia-Pabon.. (2000) (6 citations) (Correct)
....one path in P having v as ending vertex, and with arc set = f(v; w) v; w 2 V and v w 2 Pg. A digraph G = V; A) is said to be pseudo symmetric, if for any vertex v 2 V , d (v) d (v) where d (v) resp. d (v) denotes the in degree (resp. out degree) of vertex v. Theorem 1 [10] If G is a connected pseudo symmetric digraph, then G is Eulerian and an Eulerian circuit of G can be found in linear time. Let P n denote the directed symmetric path graph on n vertices. Let ST(n) denote the directed symmetric star graph on n vertices (i.e. the tree having only one internal ....
H. Fleischner. Eulerian graphs and related topics. Annals of Discrete Mathematics, no. 45, vol. 2, Elsevier Science Publisher B.V., 1991.
Transistor Chaining with Integrated Dynamic Folding for 1-D.. - Berezowski (Correct)
....contain an eulerian cycle [8, IV.1] for the needs of the leaf cell synthesis, it is enough to use the generalized concept of eulerian graph [8, V.1] and require only eulerian trail in C k not cycle. Actually, this conforms to the original Euler s formulation of the bridges of K onigsberg problem [8]. Vdd Vss m 3 4 (ii) iii) m 5 (i) a b c 6 y Figure 1. Transistor placement example: a) transistor netlist (b) its graph model with the minimum set of eulerian trails (c) its minimum width layout The need for transistor folding arises in the performancedriven cell ....
....model the transistor folding. Definition 3. 1 The k replacement replaces the edge e i in G with the k edges E i = fe i 1 ; e i k g such that: 8j 2 f1; kg g(e i j ) g(e i ) f(e i j ) f(e i ) where g(e) and f(e) are the head and the tail functions respectively [8]. The edge e i is called replaced edge and the edges in E i are called replacing edges. Definition 3.2 The k replacement is odd if k = 2n 1: Definition 3.3 The k replacement is even if k = 2n: Now, on the basis of the eulerian graph theorems and corollaries that can be found in [8, IV.1, ....
H. Fleischner. Eulerian Graphs and Related Topics. Elsevier Science Publishers B.V., 1990.
Transistor Chaining with Integrated Dynamic Folding - For Leaf Cell (2001) (Correct)
No context found.
H. Fleischner. Eulerian Graphs and Related Topics. Elsevier Science Publishers B.V., 1990.
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