J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, R. Rustin, ed., Algorithmics Press, New York, 1972, pp. 91--96.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....graph has at most kn edges. Clearly,ak connected (i.e. k node connected or k edge connected) graph has at least kn=2 edges, since each node has degree k. Similarly,every k connected digraph has at least kn arcs (directed edges) since each node has outdegree k, and results of Edmonds [Ed 72] and Mader [Ma 85] imply that every minimal k connected digraph has at most 2kn arcs. These facts immediately imply a 2approximation algorithm for all four versions of the problem, since there is an easy polynomial time algorithm to find a minimal k edge connected (or k node connected) spanning ....

J. Edmonds, "Edge-disjoint branchings," in Combinatorial Algorithms, Ed. R. Rustin, Algorithmics Press, New York, 1972, 91--96.

....flow from s to t in G is T ) we can prove that it is always possible to find a collection of aggregation trees, via the GETTREE algorithm, which can be used to aggregate T data packets from each of the sensors. The proof of correctness is based on a powerful theorem in graph theory (Edmonds[5], Lovasz[15] and is omitted due to lack of space. We refer to the algorithm described in this section, for finding a maximum lifetime schedule with data aggregation, as the MLDA algorithm. IV. CMLDA : CLUSTERING BASED MLDA HEURISTIC Given the location of n sensors and a base station t, we can ....

J. Edmonds. Edge --disjoint branchings. In Combinatorial Algorithms, Academic Press, 1973.

....of these had running time O(min C , mn ) on directed graphs and O(Cminn ) on undirected graphs. Thus, the spanning tree packing approach led to the first sub quadratic (in n) algorithm for determining global connectivity. This approach revolves around two classical theorems by Edmonds [8, 7], stated below. Here, an r arborescence is a directed spanning tree rooted at a specified root vertex r with all edges directed away from r, an r cut is the set of edges directed from V S to S, where S is any subset of the vertices not containing r, and a directionless r spanning tree is like ....

....from r, an r cut is the set of edges directed from V S to S, where S is any subset of the vertices not containing r, and a directionless r spanning tree is like an arborescence but with the weaker constraint that only edges incident on r must be directed away from the root. Edmonds Theorem[8]: The maximum number of edge disjoint r arborescences equals the minimum cardinality of an r cut. Edmonds Relaxed Theorem[7] The maximum number of edge disjoint r arborescences in a directed graph equals the maximum number of edge disjoint directionless r spanning trees with the property that ....

[Article contains additional citation context not shown here]

J. Edmonds. Edge Disjoint Branchings. Combinatorial Algorithms, R. Rustin, editor, Algorithmics Press, NY, 1972, pp. 91--96.

....We call the operation (ii) in these theorems pinching k edges (with z) This kind of characterizations can be very useful. For example, Lov asz used his result to derive Nash Williams theorem [12] on k edge connected orientations of graphs, while Mader used his result to derive Edmonds theorem [1] on disjoint arborescences. k edge connectivity is the usual way to formulate one s intuitive feeling for high edge connection of an undirected graph but there may be other possibilities, as well. We call an undirected graph k tree connected if it contains k edge disjoint spanning trees. In 1961 ....

J. Edmonds, Edge disjoint branchings. in: B. Rustin, ed., Combinatorial Algorithms (Academic Press, New York, 1973) 91-96.

....is, a directed acyclic subgraph where a has in degree zero and every other node has in degree one. An a cut is a cut; its value is the total capacity of edges crossing the partition from the side that includes a to the other. Two theorems of Edmonds relate a cuts and a arborescences: Theorem 2.3. 1 [20] In a directed graph the maximum number of edge disjoint a arborescences equals the minimum value of an a cut. Theorem 2.3.2 [19] The edges of a directed graph can be partitioned into k a arborescences if and only if they can be partitioned into k spanning trees where every vertex except a has ....

J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91--96, New York, 1972. Algorithmics Press.

.... recently Huck has proved it for connected planar graphs with : 4 [24] and : 5 [26] i.e. for all planar graphs, since 6 connected graphs are nonplanar) Similar conjectures have been formulated considering edge connectivity instead of vertex connectivity [27, 32] and for directed graphs [16, 25, 46, 52]. 1.4 New Results Our new results are outlined as follows: We define realizers of triconnected planar graphs, and show how to construct them in linear time. Our definition naturally extends the one by Schnyder [37] using a chromatic framework such that each edge of the graph has one or two ....

J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91 96. Algorithmics Press, New York, 1972. 33

....is, a directed acyclic subgraph where a has in degree zero and every other node has in degree one. An a cut is a cut; its value is the total capacity of edges crossing the partition from the side that includes a to the other. Two theorems of Edmonds relate a cuts and a arborescences: Theorem 2.3. 1 [20] In a directed graph the maximum number of edge disjoint a arborescences equals the minimum value of an a cut. Theorem 2.3.2 [19] The edges of a directed graph can be partitioned into ka arborescences if and only if they can be partitioned into k spanning trees where every vertex except a has ....

J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91--96, New York, 1972. Algorithmics Press.

....of (A 3 ) and (B 3 ) was proved by W.T. Tutte [47] Theorem 1.2 (Tutte) A graph contains k edge disjoint spanning trees i the number of cross edges of every partition fV 1 ; V t g of V is at least k(t 1) Finally, the equivalence of de nitions (A 4 ) and (B 4 ) was proved by J. Edmonds [7]. Theorem 1.3 (Edmonds) A digraph D contains k edge disjoint spanning arborescences rooted at r i D (X) k for every non empty subset X of V r. We extend these notions even further. For non negative integers l k, a digraph D is (k; l) edge connected if D has a node r so that there are k ....

J. Edmonds { Edge-disjoint branchings, in: Combinatorial Algorithms, Academic Press, New York (1973) 91-96.

....; Analogously to the case of digraphs, the set function H has the following property: Claim 2.2. Let H be a directed hypergraph, and X; Y V . Then H (X) H (Y ) H (X Y ) H (X [ Y ) d H (X; Y ) Like Menger s theorem, J. Edmonds disjoint branching theorem [1] can be easily adapted to directed hypergraphs. Given a set S V , a directed hypergraph H = V; E) is connected from S if every node v 2 V is weakly reachable from some s 2 S. Proposition 2.3. Let H = V; E) be a directed hypergraph, and S 1 ; S k subsets of V ; for X ....

J. Edmonds, Edge-disjoint branchings, in: B. Rustin, ed., Combinatorial Algorithms (Acad. Press, New York, 1973) 91-96.

No context found.

J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, R. Rustin, ed., Algorithmics Press, New York, 1972, pp. 91--96.

No context found.

J. Edmonds, "Edge-disjoint branchings," in: Combinatorial Algorithms, ed. R. Rustin, pp. 91-96, Academic Press, NY, 1973.

No context found.

J. Edmonds, Edge-disjoint branchings. In Combinatorial Algorithms (B. Rustin ed.) pages 91-96. Academic Press, New York 1973.

No context found.

J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms (B. Rustin, ed.) , Academic Press New York (1973) 91-96.

No context found.

J. Edmonds, "Edge-Disjoint Branchings," in Combinatorial Algorithms, R. Rustin (ed.), Algorithmic Press, New York, 91--96, 1972.

No context found.

J. Edmonds, "Edge-disjoint branchings," in: Combinatorial Algorithms, ed. R. Rustin, pp. 91-96, Academic Press, NY, 1973.

No context found.

J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91--96. Academic Press, New York, 1973.

No context found.

J.R. Edmonds, Edge disjoint branchings. in: B. Rustin, ed., Combinatorial Algorithms (Academic Press, New York, 1973) 91-96.

No context found.

J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91--96. Algorithmic Press, New York, 1972.

No context found.

J. Edmonds (1967) Edge-disjoint branchings, in: Combinatorial algorithms, Academic Press, New York.

No context found.

J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, R. Rustin, Ed., pp. 91-96. Algorithmics Press, New York, 1972.

No context found.

J. Edmonds. Edge-disjoint branchings. In Combinatorial Algorithms, Academic Press, 1973.

No context found.

J. Edmonds. Edge --disjoint branchings. In Combinatorial Algorithms, Academic Press, 1973.

No context found.

J. Edmonds. Edge --disjoint branchings. In Combinatorial Algorithms, Academic Press, 1973.

No context found.

J. Edmonds. Edge-disjoint branchings. In Combinatorial Algorithms, Academic Press, 1973.

No context found.

J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91--96. Academic Press, New York, 1973.

First 50 documents

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