𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple derivation of edmonds' algorithm for optimum branchings

✍ Scribed by R. M. Karp

Publisher
John Wiley and Sons
Year
1971
Tongue
English
Weight
266 KB
Volume
1
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Simple Optimal Parallel Algorithm for
A Simple Optimal Parallel Algorithm for a Core of a Tree
✍ S.T. Peng; W.T. Lo πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 354 KB

A core of a tree \(T=(V, E)\) is a path in \(T\) which minimizes \(\Sigma_{v \in V}\) \(d(v, P)\), where \(d(v, P)\), the distance from a vertex \(v\) to path \(P\), is defined as \(\min _{u \in P} d(v, u)\). We present an optimal parallel algorithm to find a core of \(T\) in \(O(\log n)\) time usin

Comments on a simple algorithm for the p
Comments on a simple algorithm for the plotting of contours
✍ Singh, Chandan πŸ“‚ Article πŸ“… 1990 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 225 KB

We consider a paper by about a new contour lines algorithm. Because of its exactness and its convincing straightforwardness we have tested it and incorporated it into our postprocessing software. This paper describes some aspects we experienced during the numerical experimentation which may be help

A simple derivation of the exponent Ξ³ fo
A simple derivation of the exponent Ξ³ for Gaussian chains with excluded volume
✍ Andrzej Kloczkowski; James E. Mark; Burak Erman πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 286 KB

## Abstract The exponent Ξ³ in the expression for the partition function __Z__ β‰… ΞΌ^__N__^ Β· __N__^Ξ³βˆ’1^ is derived for a Gaussian chain. The method of Ullman is adopted. Results of calculations show that for 1, 2, 3 and 4 dimensions, Ξ³ = 1, 1,25, 1,2 and 1, respectively. It is also shown that Ξ³ remai