1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
NP-complete variants of some classical graph problems
Per Alexandersson
Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are…
cs.CC2019
LaserTank is NP-complete
Per Alexandersson, Petter Restadh
We show that the classical game LaserTank is -complete, even when the tank movement is restricted to a single column and the only blocks appearing on the board are mir…