Skip to main content

and
  1. No Access

    Article

    Parallel Bounded Search for the Maximum Clique Problem

    Given an undirected graph, the Maximum Clique Problem (MCP) is to find a largest complete subgraph of the graph. MCP is NP-hard and has found many practical applications. In this paper, we propose a parallel B...

    Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li in Journal of Computer Science and Technology (2023)