The Inverse Voronoi Problem in Graphs I: Hardness.
Édouard BonnetSergio CabelloBojan MoharHebert Pérez-RosésPublished in: Algorithmica (2020)
Keyphrases
- graph matching
- graph theoretic
- graph theory
- directed graph
- learning theory
- neighborhood graph
- graph data
- graph mining
- graph structure
- structured objects
- voronoi diagram
- graph representation
- graph databases
- graph model
- computational complexity
- information theoretic
- euclidean distance
- semi supervised
- np hard
- lower bound