Login / Signup
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs.
Sancrey Rodrigues Alves
Konrad Kazimierz Dabrowski
Luérbio Faria
Sulamita Klein
Ignasi Sau
Uéverton S. Souza
Published in:
CoRR (2017)
Keyphrases
</>
parameterized complexity
global constraints
bounded treewidth
fixed parameter tractable
graph theory
weighted graph
graph theoretic
np hard
directed graph
graph structure
random graphs
symmetry breaking