BIROn - Birkbeck Institutional Research Online

    Parity games on graphs with medium tree-width

    Fearnley, J. and Lachish, Oded (2011) Parity games on graphs with medium tree-width. In: Murlak, F. and Sankowski, P. (eds.) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 6907. Berlin, Germany: Springer Verlag, pp. 303-314. ISBN 9783642229930.

    Full text not available from this repository.

    Abstract

    This paper studies the problem of solving parity games on graphs with bounded tree-width. Previous work by Obdržálek has produced an algorithm that uses nO(k2) time and nO(k2) space, where k is the tree-width of the graph that the game is played on. This paper presents an algorithm that uses n O(k logn) time and O(n + k logn) space. This is the fastest known algorithm for parity games whose tree-width k satisfies (in standard asymptotic notation) k ∈ ω(logn) and k∈o(n−√/logn).

    Metadata

    Item Type: Book Section
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 30 May 2013 14:10
    Last Modified: 11 Oct 2016 12:01
    URI: http://eprints.bbk.ac.uk/id/eprint/7115

    Statistics

    Downloads
    Activity Overview
    0Downloads
    135Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item