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

The Complexity of Some Combinatorial Constructions

โœ Scribed by Hans Georg Carstens

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
530 KB
Volume
23
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

โœฆ Synopsis

THE COMPLEXITY OF SOME COMBINATORIAL CONSTRUCTIONS by HASS GEORG C'ARSTENS in Hanriover (G.F.R.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial Construction of Some Near
Combinatorial Construction of Some Near Polygons
โœ Bruce.N. Cooperstein; Ernest.E. Shult ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB

We give a construction which takes a rank two incidence geometry with three points on a line and returns a geometry of the same type, i.e., with three points on a line. It is also demonstrated that embeddings of the original geometry can be extended to the new geometry. It is shown that the family o

Some Combinatorial Results for Complex R
Some Combinatorial Results for Complex Reflection Groups
โœ H. Can ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

In this paper, we prove that a simple system for a subsystem of the complex root system can always be chosen as a subset of the positive system + of . Furthermore, we show that a set of distinguished coset representatives can be found for every reflection subgroup of the complex reflection groups. T

Some Constructions of Small Generalized
Some Constructions of Small Generalized Polygons
โœ Burkard Polster; Hendrik Van Maldeghem ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

We present several new constructions for small generalized polygons using small projective planes together with a conic or a unital, using other small polygons, and using certain graphs such as the Coxeter graph and the Pappus graph. We also give a new construction of the tilde geometry using the Pe

Combinatorial Properties and the Complex
Combinatorial Properties and the Complexity of a Max-cut Approximation
โœ Charles Delorme; Svatopluk Poljak ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 667 KB

We study various properties of an eigenvalue upper bound on the max-cut problem. We show that the bound behaves in a manner similar to the max-cut for the operations of switching, vertex splitting, contraction and decomposition. It can also be adjusted for branch and bound techniques. We introduce a