BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs.
Nikola BenesLubos BrimSamuel PastvaDavid SafránekPublished in: CoRR (2021)
Keyphrases
- dynamic programming
- computational complexity
- preprocessing
- similarity measure
- search space
- detection algorithm
- objective function
- cost function
- simulated annealing
- learning algorithm
- weighted graph
- decomposition algorithm
- particle swarm optimization
- optimal solution
- optimization algorithm
- computational cost
- tree structure
- recognition algorithm
- hyper graph
- decomposition method
- graph search
- breadth first search
- adjacency graph
- minimum spanning tree
- graph partitioning
- graph structure
- matching algorithm
- worst case
- social networks