Packing in a Hypergraph

35.58 CHF

Versandkostenfreie Lieferung!

Lieferzeit: 7-14 Werktage

Artikel-Nr.: 10219953

Beschreibung

High Quality Content by WIKIPEDIA articles! In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex. There are two famous algorithms to achieve asymptotically optimal packing in k-uniform hypergraphs. One of them is a random greedy algorithm which was proposed by Joel Spencer. He used a branching process to formally prove the optimal achievable bound under some side conditions. The other algorithm is called Rödl nibble and was proposed by Vojtech Rödl et al. They showed that the achievable packing by Rödl nibble is in some sense close to that of the random greedy algorithm.

Eigenschaften

Breite:	150
Gewicht:	150 g
Höhe:	5
Länge:	220
Seiten:	88
Sprachen:	Englisch
Autor:	Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken

Bewertung

Menü schließen

Bewertungen werden nach Überprüfung freigeschaltet.

Die mit einem * markierten Felder sind Pflichtfelder.

Ich habe die Datenschutzbestimmungen zur Kenntnis genommen.