Uharibifu wa k-Core
Uharibifu wa k-Core ni mbinu ya kinadharia ya grafu inayogawanya vipeo vya mtandao katika mfuatano wa viambajengo vilivyowekwa ndani vinavyoitwa k-cores. k-core ni kiambajengo kikubwa zaidi ambacho kila kipeo kina angalau majirani k ndani ya kiambajengo hicho. Ilianzishwa na Stephen B. Seidman mnamo 1983, mbinu hii inakipa kila kipeo nambari ya coreness inayobainisha umuhimu wake wa kimuundo kuhusiana na muunganiko wa ndani wa grafu.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5(3), 269–287. DOI: 10.1016/0378-8733(83)90028-X ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). k-Core Decomposition of Networks. ScholarGate. https://scholargate.app/sw/network-analysis/k-core-decomposition
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Uchambuzi wa UsentraliUchanganuzi wa Mitandao↔ compare
- Ugunduzi wa JumuiyaUchanganuzi wa Mitandao↔ compare
- Umuhimu wa Ukurasa (PageRank Centrality)Uchanganuzi wa Mitandao↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →