Finding Geometric Representations of Apex Graphs is NP-Hard.
Dibyayan ChakrabortyKshitij GajjarPublished in: CoRR (2021)
Keyphrases
- np hard
- approximation algorithms
- optimal solution
- graph representations
- graph theory
- graph theoretic
- linear programming
- closely related
- special case
- graph theoretical
- finding the optimal solution
- np complete
- greedy heuristic
- learning algorithm
- graph model
- scheduling problem
- graph data
- geometric information
- geometric structure
- np hardness
- data representations
- graph matching
- knapsack problem