An efficient algorithm for the density Turán problem of some unicyclic graphs.
Halina BielakKamil PowroznikPublished in: FedCSIS (2014)
Keyphrases
- detection algorithm
- improved algorithm
- k means
- theoretical analysis
- learning algorithm
- graph isomorphism
- experimental evaluation
- worst case
- high accuracy
- simulated annealing
- adjacency graph
- optimization algorithm
- segmentation algorithm
- computationally efficient
- particle swarm optimization
- cost function
- computational complexity
- data structure
- optimal solution
- objective function
- computational cost
- input data
- dynamic programming
- np hard
- significant improvement
- ant colony optimization
- tree structure
- convergence rate
- density function
- similarity measure