A Swap-Based Heuristic Algorithm for the Maximum <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Plex Problem
The maximum <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-plex problem is intended to relax the clique definition with maximum cardinality. It helps people understand the structures of networks by considering them a problem of graph cl...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8794502/ |