Let G s V, E be a t-partite graph with n vertices and m edges, where the ลฝ 2 1.5 . partite sets are given. We present an O n m time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing ลฝ edges and, at the same time, the size of the largest set of
On balanced sets and cores
โ Scribed by Lloyd S. Shapley
- Publisher
- John Wiley and Sons
- Year
- 1967
- Tongue
- English
- Weight
- 393 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
โฆ Synopsis
CORES L l o y d S . S h a p l e y
T h e R a n d C o r p o r a t i o n
* * *
๐ SIMILAR VOLUMES
B e z a l e l P e l e g Department of Mathematics The Hebrew U n i v e r s i t y of Jerusalem Jerusal en, I s r a e l and The U n i v e r s i t y of Michigan Department of Mathematics Ann Arbor. Michigan \*A l i s t is to a p p e a r in a f o r t h c o m i n g Rand M e m o r a n d u m by Shapley.
showed that the semigroup generated by all non-identity idempotent transformations of an infinite set X is the disjoint union of two semigroups, one of which is denoted by H and consists of all balanced transformations of X (that is, all transformations whose defect, shift, and collapse are equal an
An r-core of a Young diagram \* is a residual subdiagram obtained after consecutive removals of the feasible r-long border strips, ``rim hooks.'' The removal process on the diagram \* and the resulting r-core are the essential elements in the Murnaghan Nakayama formula for / \* , the character of th