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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Jing Bai, Junfeng Zhou, Ming Du, Peng Zhong
Formato: article
Lenguaje:EN
Publicado: IEEE 2021
Materias:
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>
Electrical engineering. Electronics. Nuclear engineering
TK1-9971
Acceso en línea:https://doaj.org/article/b554445da06c4e41a07fa51d01a42232
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Internet

https://doaj.org/article/b554445da06c4e41a07fa51d01a42232

Ejemplares similares