BIROn - Birkbeck Institutional Research Online

    A faster solving of the maximum independent set problem for graphs with maximal degree 3

    Razgon, Igor (2006) A faster solving of the maximum independent set problem for graphs with maximal degree 3. In: Broersma, H. and Dantchev, S.S,. and Johnson, M. and Szeider, S. (eds.) Algorithms and Complexity 2006: Proceedings of the Second ACiD Workshop. Texts in Algorithmics 7. King's College, London, UK, pp. 131-142.

    Full text not available from this repository.

    Abstract

    We present an O(1:1034,) for the problem obtained by Chen et al [2].

    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 11:22
    Last Modified: 09 Aug 2023 12:52
    URI: https://eprints.bbk.ac.uk/id/eprint/46240

    Statistics

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

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item