Zobacz książki o podobnej tematyce

Więcej informacji o Combinatorial Generation

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 131 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Computing & information technology Information technology: general issues

• Pełny tytuł: Combinatorial Generation
• Podtytuł: A Genealogical Tree-based Approach
• Autor: Shariful I. Bhuyan
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 56
• EAN: 9783639232202
• ISBN: 3639232208
• ID: 06830953
• Wydawca: VDM Verlag
• Waga: 95 g
• Wymiary: 229 × 152 × 3 mm
• Data wydania: 15. March 2010

Ulubione w innej kategorii

---

---

---