Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.
Pranabendu MisraSaket SaurabhRoohani SharmaMeirav ZehaviPublished in: Algorithmica (2023)
Keyphrases
- graph layout
- computational complexity
- run times
- optimization problems
- small number
- benchmark problems
- space complexity
- polynomial time complexity
- data structure
- significant improvement
- orders of magnitude
- problems in computer vision
- practical problems
- related problems
- test problems
- computationally efficient
- np complete
- worst case
- relational databases
- learning algorithm
- memory requirements
- database
- difficult problems
- information extraction
- equivalence classes
- exponential size
- information retrieval