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.

Official URL: http://dx.doi.org/10.1007/978-3-642-22993-0_29

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 Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	30 May 2013 14:10
Last Modified:	09 Aug 2023 12:33
URI:	https://eprints.bbk.ac.uk/id/eprint/7115

Statistics

Archive Staff Only (login required)

Edit/View Item