Spanning Tree Game as Prim Would Have Played
| Autor: | András London, András Pluhár |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Frieze
Information Systems and Management Spanning tree Computer science 0102 computer and information sciences Management Science and Operations Research 01 natural sciences Theoretical Computer Science Combinatorics 010201 computation theory & mathematics restrict Computer Science (miscellaneous) Computer Vision and Pattern Recognition Electrical and Electronic Engineering Software |
| Zdroj: | Acta Cybernetica. 23:921-927 |
| ISSN: | 0324-721X |
| DOI: | 10.14232/actacyb.23.3.2018.12 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|