<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Graph on Bluue Whale</title><link>https://bluuewhale.github.io/tags/graph/</link><description>Recent content in Graph on Bluue Whale</description><image><title>Bluue Whale</title><url>https://bluuewhale.github.io/images/profile.jpg</url><link>https://bluuewhale.github.io/images/profile.jpg</link></image><generator>Hugo -- 0.152.2</generator><language>en-us</language><lastBuildDate>Sat, 22 Aug 2026 22:21:36 +0900</lastBuildDate><atom:link href="https://bluuewhale.github.io/tags/graph/index.xml" rel="self" type="application/rss+xml"/><item><title>Sparse Matrix &amp; CSR</title><link>https://bluuewhale.github.io/posts/sparse-matrix-and-csr-en/</link><pubDate>Wed, 01 Apr 2026 16:23:49 +0900</pubDate><guid>https://bluuewhale.github.io/posts/sparse-matrix-and-csr-en/</guid><description>How CSR (Compressed Sparse Row) represents a sparse matrix with just three arrays, values, column_indices, and row_pointers, and why it speeds up sparse matrix-vector multiplication and graph neighbor lookups.</description></item><item><title>Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters</title><link>https://bluuewhale.github.io/posts/ego-splitting-framework-en/</link><pubDate>Fri, 27 Mar 2026 16:45:22 +0900</pubDate><guid>https://bluuewhale.github.io/posts/ego-splitting-framework-en/</guid><description>How the Ego-Splitting Framework solves overlapping clustering with an ordinary non-overlapping clustering algorithm, by splitting each node into one persona per community it belongs to.</description></item><item><title>Community Detection</title><link>https://bluuewhale.github.io/posts/community-detection-en/</link><pubDate>Mon, 23 Mar 2026 23:18:53 +0900</pubDate><guid>https://bluuewhale.github.io/posts/community-detection-en/</guid><description>Where modularity comes from as a way to measure how well-formed a community is, and how the Louvain and Leiden algorithms differ in optimizing it.</description></item></channel></rss>