Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.
Pranabendu MisraSaket SaurabhRoohani SharmaMeirav ZehaviPublished in: FSTTCS (2018)
Keyphrases
- graph layout
- run times
- optimization problems
- computational complexity
- benchmark problems
- small number
- difficult problems
- combinatorial optimization
- memory requirements
- problems in computer vision
- space complexity
- test problems
- genetic algorithm
- polynomial time complexity
- computational cost
- search methods
- computationally efficient
- complex structures
- related problems
- practical problems
- integrity constraints
- np complete
- fixed parameter tractable
- state space
- worst case