Parameterized Complexity of 1-Planarity.

Michael J. Bannister Sergio Cabello David Eppstein

Published in: J. Graph Algorithms Appl. (2018)

Keyphrases

parameterized complexity
fixed parameter tractable
global constraints
approximation algorithms
symmetry breaking
database
np hard
databases
objective function
worst case
decision problems
computational problems