Login / Signup
On the Parameterized Complexity of k-Edge Colouring.
Esther Galby
Paloma T. Lima
Daniël Paulusma
Bernard Ries
Published in:
CoRR (2019)
Keyphrases
</>
parameterized complexity
global constraints
fixed parameter tractable
undirected graph
symmetry breaking
search algorithm
np hard