Combinatorial algorithm for counting small induced graphs and orbits.
Tomaz HocevarJanez DemsarPublished in: CoRR (2016)
Keyphrases
- cost function
- experimental evaluation
- times faster
- computational cost
- dynamic programming
- high accuracy
- optimal solution
- computational complexity
- recognition algorithm
- significant improvement
- learning algorithm
- linear programming
- np hard
- genetic algorithm
- improved algorithm
- undirected graph
- maximum common subgraph
- ant colony optimization
- clustering method
- detection algorithm
- optimization algorithm
- theoretical analysis
- input data
- worst case
- knn
- search space
- preprocessing
- bayesian networks