Finding Geometric Representations of Apex Graphs is NP-Hard.
Dibyayan ChakrabortyKshitij GajjarPublished in: WALCOM (2022)
Keyphrases
- np hard
- graph representations
- closely related
- geometric models
- special case
- worst case
- np complete
- approximation algorithms
- similarity measure
- finding the optimal solution
- topological information
- graph theoretic
- graph representation
- spanning tree
- geometric structure
- geometric constraints
- directed graph
- decision problems
- constraint satisfaction problems
- lower bound
- optimal solution
- neural network
- graph structure
- graph theory
- knapsack problem
- graph model
- complex structures
- graph construction
- graph theoretical
- approximation guarantees
- object recognition