Efficient <italic>(k, &#x03B1;)</italic>-Maximal-Cliques Enumeration Over Uncertain Graphs

Efficient <italic>(k, &#x03B1;)</italic>-Maximal-Cliques Enumeration Over Uncertain Graphs

A maximal clique (<inline-formula> <tex-math notation="LaTeX">${MC}$ </tex-math></inline-formula>) is a complete subgraph satisfying that no other cliques can take it as their proper subgraph. Given an uncertain graph, the <inline-formula> <tex-math notatio...

Full description

Bibliographic Details
Main Authors: Jing Bai, Junfeng Zhou, Ming Du, Peng Zhong
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Uncertain graph
maximal clique
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">top-K</italic>
Online Access:https://ieeexplore.ieee.org/document/9599685/

Internet

https://ieeexplore.ieee.org/document/9599685/

Similar Items