Spanning trees with a given number of leaves
Keyword(s):
We prove the hardness of yet another problem in graph theory with a flavor of computer games, namelyTerra Mystica. Much like works of Demaine and others, we abstract the computer game to have a mathematicalmodel which is in the form of combinatorial optimization. A reduction from 3Sat shows that our claim holds.
2014 ◽
Vol 13
(8)
◽
pp. 4760-4766
Keyword(s):
2017 ◽
Vol 1
(2)
◽
pp. 17
◽
Keyword(s):
2021 ◽
Keyword(s):
Keyword(s):
1997 ◽
Vol 84
(1)
◽
pp. 3-15
◽
1988 ◽
Vol 32
(18)
◽
pp. 1266-1270
◽