Work

A faster algorithm for Cops and Robbers

Year: 2022

Type: article

Abstract: We present an algorithm of time complexity O(knk+2) deciding whether a graph G on n vertices is k-copwin. The fastest algorithm thus far had time complexity O(n2k+2).

Source: Discrete Applied Mathematics

DOI: 10.1016/j.dam.2022.05.019

Authors: Jan Petr, Julien Portier, Leo Versteegen

Institution: University of Cambridge

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,840

Funders: University of Cambridge, Cambridge Trust, Engineering and Physical Sciences Research Council, Trinity College, University of Cambridge

OpenAlex ID: W4281928119

FWCI: 0.64

Cites: 10

Cited by: 7

Related to: 10