Closely Related <i>k</i>-Core Subgraph Query Based on Greedy Strategy
<i>k</i>-core query is a type of community query because it can be calculated effectively in linear time and has a wide range of applications in community detection.In some scenarios, the weights of edges in graphs exhibit strong semantics, but the weights of edges in graphs were rarely considered i...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Editorial Office of Computer Engineering
2022-10-01
|
| Edice: | Jisuanji gongcheng |
| Témata: | |
| On-line přístup: | https://www.ecice06.com/fileup/1000-3428/PDF/20221007.pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|