BIROn - Birkbeck Institutional Research Online

    Pruning by equally constrained variables

    Razgon, Igor and Meisels, A. (2004) Pruning by equally constrained variables. In: Faltings, B. and Petcu, A. and Fages, F. and Rossi, F. (eds.) Recent Advances in Constraints: CSCLP 2004. Lecture Notes in Computer Science 3419. Springer, pp. 26-40.

    Full text not available from this repository.

    Abstract

    We introduce a notion of equally constrained variables of a constraint network. We propose a method of pruning that uses the notion. We combine the proposed method of pruning with FC-CBJ and call the resulting algorithm FC-CBJ-EQ. Our experimental results show that FC-CBJ-EQ outperforms FC-CBJ on constraint networks that encode randomly generated instances of graph k-coloring and of the subgraph isomorphism problems.

    Metadata

    Item Type: Book Section
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Sarah Hall
    Date Deposited: 11 Oct 2021 12:26
    Last Modified: 09 Aug 2023 12:52
    URI: https://eprints.bbk.ac.uk/id/eprint/46246

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    95Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item