#圖論

Live, measured metrics for the hashtag #圖論 from the open social web. Every number carries a named source and the time it was fetched. Nothing is estimated.

hashtag.org network · sponsored

Own #圖論

This #name is available to claim. It becomes your portal on the open agent web: this very page, a keyword you rank for by an open public stake, and a verifiable identity for AI agents. Nobody else sells a page like this for every #name.

$11,525.77/ year · 2-character #name
Claim #圖論$11,525.77/yrBuy on hashtag.space (web3)
card via hashtag.org · tokens via hashtag.space
0
Uses / 7 days
Mastodon
0
Accounts / 7 days
Mastodon
15
Recent posts
Mastodon
~0/hr
Recent pace
Mastodon · last 15
0
Avg reactions / post
Mastodon · last 15
Reddit posts / month
Reddit search
Open-web mentions
hashtag.org Firehose

Day-by-day usage

measured · fosstodon.org (Mastodon public tags API) · fetched 2026-08-24 17:57 UTC
0
08-18
0
08-19
0
08-20
0
08-21
0
08-22
0
08-23
0
08-24

0 uses by 0 unique accounts across the window. Real per-day counts, not estimates. Newest bar is today so far.

Related hashtags

measured · fosstodon.org (Mastodon public search API) · fetched 2026-08-24 17:57 UTC

No related tags with measured usage found for #圖論.

Live pulse

measured · fosstodon.org (Mastodon tag timeline) · fetched 2026-08-24 17:57 UTC

Everything below is measured over the latest 15 public posts (spanning ~11759 hours).

Top of the latest posts

  • 🌘 零知識證明速覽 ➤ 用 30 行 Python 程式碼,輕鬆理解無關加密貨幣的圖論零知識證明 ✤ https://bernsteinbear.com/blog/zkp/ 本文介紹如何透過圖形三色問題實作一個不涉及加密貨幣的零知識證明系統。作者參考經典學術論文,以 Python 實作證明者如何隨機排列顏色、加入隨機鹽值以產生雜湊,藉此在不透露具體著色方案的情況下向驗證者證明其擁有解答。 + 原來零知識證明可以用這麼簡單的圖形三色問題來解釋,看完程式碼後完全懂了! + 使用

    GripNews@[email protected]012026-08-16 23:19 UTCView post →
  • 🌘 $k$-著色問題比計算色數更快速 ➤ 突破演算法瓶頸:圖形著色問題理論的重大進展 ✤ https://arxiv.org/abs/2607.25973 本研究證明瞭在 $n$ 個頂點的圖上進行 $k$-著色問題存在一種隨機演算法,其運行時間可達到 $(2-\varepsilon_k)^n$(其中對於每個固定的 $k$,$\varepsilon_k>0$)。過去只有當 $k\leq 6$ 時才存在比通用色數計算演算法更快的解法。作者透過推廣與結合先前的技術,並設計處理混合

    GripNews@[email protected]002026-08-08 13:19 UTCView post →
  • 🌗 關於循環雙覆蓋猜想的證明 ➤ 從圖論經典難題到線性代數的精確求解 ✤ https://cdn.openai.com/pdf/04d1d1e4-bc75-476a-97cf-49055cd98d31/cdc_proof.pdf 本文展示了關於圖論中「循環雙覆蓋猜想」(Cycle Double Cover Conjecture)的證明。該猜想指出,任何無橋的無向圖都能找到一組循環,使得圖中每條邊都被恰好覆蓋兩次。作者透過將問題簡化為三次圖(Cubic Graphs)模型,運

    GripNews@[email protected]002026-07-10 19:17 UTCView post →

#圖論 across platforms

every network with a public tag surface

Follow #圖論 straight to each platform’s own tag page. Where a platform publishes open data we measure it above; the rest lock their numbers behind paid APIs, so we link rather than guess.

Every number above is measured from a named public API at the shown fetch time. Nothing is estimated or extrapolated. Platforms that lock their data behind paid APIs are not shown. Agents: the same numbers, as JSON, at /api/hashtags/圖論