Kniha Combinatorial Generation Shariful I. Bhuyan

Combinatorial Generation

A Genealogical Tree-based Approach

Jazyk: Angličtina
Vazba: Brožovaná
Vydavatel: VDM Verlag
Dostupnost: U nakladatele na objednávku
Odesíláme za 17-27 dnů
1 174
Efficient generation of combinatorial objects is a well-researched area. Among them many literature...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2010
Stránek
56
EAN
9783639232202
ISBN
3639232208
Enbook ID
06830953
Vydavatel
Hmotnost
95
Rozměry
152 x 229 x 3

Kompletní popis

Efficient generation of combinatorial objects is a well-researched area. Among them many literature devoted on the combinatorial Gray code approach where the goal is to find a Hamiltonian path or cycle in a representative graph of the corresponding combinatorial class. Another approach namely genealogical tree approach has been recently introduced where the goal is to find a rooted spanning tree in the representative graph. Researchers have also focused on finding general patterns in the generation techniques of combinatorial classes so that common approaches can be applied to a large number of related problems. Here, we propose a unifying framework for combinatorial generation by giving recursive definition of an abstract combinatorial class. The definition can be instantiated to an array of specific combinatorial classes namely n-tuple, combination, integer partition, set partition and binary trees by specifying the framework parameters appropriately. As an illustration, we show the instantiation of the combinatorial class of n-tuples, combinations and balanced parenthesis strings and also give novel constant-time generation algorithm for each of them.

Mohlo by vás zajímat

3 426

Patterns

Claire Bingham
465

The Cooking Garden

Emily Huntington
416
235
668
411
3 294
270

Ambiguities

David Reid
2 177

TT Viruses

Ethel-Michele de Villiers
3 426

Zákaznicí kteří koupili tuto knihu koupili také

Leer bien 6

Pedro Olaya Ruano
382

Estrategias competitivas

Galveas Oliveira Rafael
1 219
479