Finding geometric representations of apex graphs is NP-hard.
Dibyayan ChakrabortyKshitij GajjarPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- np hard
- graph theoretical
- scheduling problem
- optimal solution
- neural network
- finding the optimal solution
- integer programming
- special case
- closely related
- graph representations
- topological information
- greedy approximation algorithm
- reeb graph
- np hardness
- graph theoretic
- graph partitioning
- minimum cost
- graph theory
- bipartite graph
- approximation algorithms
- np complete
- higher level