Efficient <italic>(k, α)</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...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
IEEE
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/b554445da06c4e41a07fa51d01a42232 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|