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

The generalized P-forest problem on a tree network

โœ Scribed by Arie Tamir; Timothy J. Lowe

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
665 KB
Volume
22
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a tree-cutting problem of P. Ash
On a tree-cutting problem of P. Ash
โœ I. Krasikov ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 597 KB

Krasikov, I., On a tree-cutting problem of P. Ash, Discrete Mathematics 93 (1991) 55-61. It is shown that in every tree T with N vertices, there are k vertices such that the connected components obtained by deleting those k vertices can be partitioned into two classes C;k and Ci with Moreover, for e

A Solution to the Generalized Cevian Pro
A Solution to the Generalized Cevian Problem Using Forest Polynomials
โœ Matthew Hudelson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 156 KB

In this paper, we examine the effect of dissecting an n-dimensional simplex using cevians (cross-sections passing through n&1 of the vertices of the simplex). We describe a formula for the number of pieces the simplex is dissected into using a polynomial involving only the number of each type of cev

The preemptive swapping problem on a tre
The preemptive swapping problem on a tree
โœ Shoshana Anily; Michel Gendreau; Gilbert Laporte ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 237 KB ๐Ÿ‘ 1 views