Winner Determination Algorithms for Graph Games with Matching Structures

Cram , Domineering , and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges during a game form a matching. In this paper, we define a generalized game called Colored Arc Kayles , which includes these games. Colored Arc...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 86; číslo 3; s. 808 - 824
Hlavní autoři:	Hanaka, Tesshu, Kiya, Hironori, Ono, Hirotaka, Yoshiwatari, Kanae
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2024 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Games Graph theory Matching Mathematics of Computing Theory of Computation Trees (mathematics) Vertex cover Neighborhood diversity Combinatorial game theory Exact exponential-time algorithm
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!