Abstract: Subgraph matching seeks all the occurrences of a query graph inside another graph. As it reduces to subgraph isomorphism, it is NP-hard. Current methods reduce the computation by filtering ...
A Hybrid Parallel Willow Catkin Optimization Algorithm Applied for Engineering Optimization Problems
Abstract: The Willow Catkin Optimization Algorithm (WCO) is a newly proposed meta-heuristic algorithm in recent years that has a simple structure and excellent optimization searching ability, but the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results