BIROn - Birkbeck Institutional Research Online

    Beyond hypertree width: decomposition methods without decompositions

    Chen, Hubie and Dalmau, V. (2005) Beyond hypertree width: decomposition methods without decompositions. In: van Beek, P. (ed.) CP 11th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 3709. Springer, pp. 167-181. (Unpublished)

    Full text not available from this repository.

    Abstract

    The general intractability of the constraint satisfaction problem has motivated the study of restrictions on this problem that permit polynomial-time solvability. One major line of work has focused on structural restrictions, which arise from restricting the interaction among constraint scopes. In this paper, we engage in a mathematical investigation of generalized hypertree width, a structural measure that has up to recently eluded study. We obtain a number of computational results, including a simple proof of the tractability of CSP instances having bounded generalized hypertree width.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 14:57
    Last Modified: 09 Mar 2021 14:57
    URI: https://eprints.bbk.ac.uk/id/eprint/43341

    Statistics

    Downloads
    Activity Overview
    0Downloads
    17Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item