On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling.
Amihood AmirBenny PoratPublished in: CPM (2015)
Keyphrases
- minimum weight
- real time
- directed graph
- np complete
- neural network
- genetic algorithm
- closed form
- worst case
- dynamic programming
- minimum length
- attributed graphs
- undirected graph
- uniform distribution
- information theoretic
- np hard
- computational complexity
- optimal solution
- feature selection
- search engine
- real world
- databases