To reorient is easier than to orient: an on-line algorithm for reorientation of graphs.
Marta Fiori-CaronesAlberto MarconePublished in: CoRR (2019)
Keyphrases
- computational complexity
- experimental evaluation
- optimization algorithm
- learning algorithm
- improved algorithm
- detection algorithm
- k means
- dynamic programming
- similarity measure
- times faster
- high accuracy
- graph partitioning
- input data
- computational cost
- multi objective
- search space
- optimal solution
- worst case
- np hard
- linear programming
- computationally efficient
- association rules
- lower bound
- graph structure
- spanning tree
- genetic algorithm