May 18, 2021 · In the paper, we develop an exact algorithm, Maplex, for solving this problem in real world graphs practically.

Based on the ex- isting first-order and the novel second-order reduction rules, we design a powerful preprocessing method which efficiently removes redundant ...

In the paper, we develop an exact algorithm, Maplex, for solving this problem in real world graphs practically. Based on the existing first-order and the novel ...

We propose a new framework for computing maximum k-plex over large sparse graphs, by iteratively extracting small dense subgraphs from it and then solving each ...

Jun 11, 2024 · Zhou et al. “Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding”. In: Proc. of AAAI'21. 2021. 4Hua Jiang et ...

Jan 19, 2024 · Improving maximum k-plex solver via second-order reduction and graph color bounding. In Proceedings of the 35th AAAI Conference on ...

Both the problem of maximum k-plex computation, which computes a k-plex with the ... Improving. Maximum k-plex Solver via Second-Order Reduction and Graph Color.

Jan 18, 2023 · In this paper, we investigate the relaxation properties of k-plex and propose an effective upper bound called Relaxed Graph color Bound (RGB) for the MkP.

Improving maximum k-plex solver via second-order reduction and graph color bounding‏. Y Zhou, S Hu, M Xiao, ZH Fu‏. Proceedings of the AAAI Conference on ...

Jun 2, 2024 · In this paper, we propose a new alternated reduction-and-bound method AltRB for conducting RB. AltRB first partitions a branch into two parts ...