Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). An efficient graph clustering algorithm by exploiting k-core decomposition and motifs. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-efficient-graph-clustering-algorithm-by-exploiting-k-core-decomposition-and-motifs
MLA“An efficient graph clustering algorithm by exploiting k-core decomposition and motifs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-efficient-graph-clustering-algorithm-by-exploiting-k-core-decomposition-and-motifs.
BibTeX@misc{4ortxyz_an-efficient-graph-clustering-algorithm-by-exploiting-k-core-decomposition-and-motifs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An efficient graph clustering algorithm by exploiting k-core decomposition and motifs}}, year = {2026}, url = {https://4ort.xyz/entity/an-efficient-graph-clustering-algorithm-by-exploiting-k-core-decomposition-and-motifs}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An efficient graph clustering algorithm by exploiting k-core decomposition and motifs — https://4ort.xyz/entity/an-efficient-graph-clustering-algorithm-by-exploiting-k-core-decomposition-and-motifs (retrieved 2026-05-24)
