๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Edge and vertex intersection of paths in a tree

โœ Scribed by Martin Charles Golumbic; Robert E. Jamison

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
572 KB
Volume
55
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient path and vertex exchange in st
Efficient path and vertex exchange in steiner tree algorithms
โœ Duin, Cees; Vo?, Stefan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 349 KB

Steiner's problem in a weighted graph requires a tree of minimum total weight spanning a subset of special vertices. In this paper, we formulate efficient routines for greedy exchanges of paths as well as vertices. The heuristic proposed on the basis of these routines consists of three phases: an in

Vertex-disjoint paths and edge-disjoint
Vertex-disjoint paths and edge-disjoint branchings in directed graphs
โœ R. W. Whitty ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 482 KB

A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every vertex has k edge-disjoint paths to r . We conjecture an extension of this theorem to vertex-disjoint paths and give a constructive proof of the conjecture in the case k = 2.

Packing k-edge trees in graphs of restri
Packing k-edge trees in graphs of restricted vertex degrees
โœ A.K. Kelmans ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB ๐Ÿ‘ 1 views

## Abstract Let ${\cal G}^{s}\_{r}$ denote the set of graphs with each vertex of degree at least __r__ and at most __s__, __v__(__G__) the number of vertices, and ฯ„~__k__~ (__G__) the maximum number of disjoint __k__โ€edge trees in __G__. In this paper we show that if __G__ โˆˆ ${\cal G}^{s}\_{2}$ a