Spanning Tree Game as Prim Would Have Played | Zendy

András London | Zendy; András Pluhár | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Spanning Tree Game as Prim Would Have Played

Author(s) -

András London,

András Pluhár

Publication year - 2018

Publication title -

acta cybernetica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.143

H-Index - 18

eISSN - 2676-993X

pISSN - 0324-721X

DOI - 10.14232/actacyb.23.3.2018.12

Subject(s) - game tree , combinatorics , spanning tree , tree (set theory) , computer science , combinatorial game theory , mathematics , theoretical computer science , mathematical economics , sequential game , game theory

In this paper, we investigate special types of Maker-Breaker games defined on graphs. We restrict Maker's possible moves that resembles the way that was introduced by Espig, Frieze, Krivelevich and Pedgen [9]. Here, we require that the subgraph induced by Maker's edges must be connected throughout the game. Besides the normal play, we examine the biased and accelerated versions of these games.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research