Reduced-size formulations for metric and cut polyhedra in sparse graphs.
Viet Hung NguyenMichel MinouxDang Phuong NguyenPublished in: Networks (2017)
Keyphrases
- high dimensional
- uniform random
- graph matching
- maximum common subgraph
- bounded treewidth
- sparse data
- maximal cliques
- special case
- graph theory
- graph theoretic
- graph representation
- markov equivalence classes
- gaussian graphical models
- min cut
- clustering algorithm
- metric space
- distance metric
- sparse representation
- face recognition