Combinatorial Generation Genealogical Tree Based by Bhuyan Shariful (3 results)

Author: 
Title: 
Refine with Advanced Search

Refine your search

  • Books (3)

to

Custom price range (£)

to

  • Language: English

    Published by VDM Verlag Dr. Müller, 2010

    3639232208 / 9783639232202

    • Softcover

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    £ 37.89

    £ 59.33 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Taschenbuch. Condition: Neu. Combinatorial Generation | A Genealogical Tree-based Approach | Shariful I. Bhuyan | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639232202 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

  • Language: English

    Published by VDM Verlag Dr. Müller, 2010

    3639232208 / 9783639232202

    • Softcover

    Seller: Mispah books, Redhill, SURRE, United KingdomMispah books

    4-star seller
    Contact seller

    Condition: Used - As new

    £ 101.00

    £ 25.00 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: 1 available

    Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Language: English

    Published by VDM Verlag Dr. Müller, 2010

    3639232208 / 9783639232202

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    £ 43.30

    £ 29.67 shipping 
    Ships from Germany to U.S.A.

    Quantity: 2 available

    Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…