Hardness Results for Computing Optimal Locally Gabriel Graphs.

Abhijeet Khopkar Sathish Govindarajan

Published in: CCCG (2012)

Keyphrases

minimum spanning trees
neighborhood graph
optimal solution
dynamic programming
globally consistent
computational complexity
worst case
data sets
social networks
data structure
pattern recognition
random walk
phase transition
optimal design
graph theoretic