Tootfinder

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

The other one I truly love is GitUp (https://gitup.co). Its visualization handles certain specific tasks better than anything else — tasks where I’m more concerned about the shape of the commit graph than the contents of individual commits.
Because of the way it does live updates of repo state and offers a whole-commit-graph-level undo, I’ll sometimes keep it open in the background while doing some fiddly thing in another tool (Fork, CLI, whatever) just so I can see what the ^*@# is happening.
Alas, its lack of support for commit signing means I use it less and less.

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

At home a busy ~5.2kWh import start to the (cold, ~5°C) day with a pasteurisation cycle (~2.9kWh, 8A/~2kW grid limit) with a 7-minute pause in the middle for low grid frequency, two spikes of a dishwasher eco programme (~0.7kWh, ~2kW), then a DHW production spike (~0.4kWh, ~1.3kW), then space heating (~0.7kW), all before 08:00! #grid

Apple kauft Datenbankfirma Kuzu aus Kanada
Schnelle, flexible Graph-Datenbanken ließen sich mit Kuzu erstellen. Das Unternehmen wurde ohne große Ankündigung von Apple geschluckt.
https://www.heise.d…

r-graph-gallery.com provides example code for a variety of chart types, both in base R and ggplot: #rstats #ggplot

The R Graph Gallery – Help and inspiration for R charts
The R graph gallery displays hundreds of charts made with R, always providing the reproducible code.

Oh $DEITY I am *so* fed up with the primitiveness and uselessness of modern software IDEs. I so wish I could use a powerful modern graphical IDE, like we had in the 1980s.

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

good grief, gnuplot is always a huge battle
here's a graph of the length of day (green, microseconds)
and UT1-UTC (purple, milliseconds)
from 1973 until today
the LoD is the difference from 24h, averaged over the previous 12 months - the LoD is _very_ noisy so it's hard to see the trends from a shorter averaging period
UT1-UTC is the integral of the LoD, with leap seconds to keep it in bounds
things have been a bit weird since 2020 because the LoD …

In a podcast, OpenClaw creator Peter Steinberger describes his phone calls with Mark Zuckerberg and Sam Altman, and says he had been contacted by "every big VC" (Marcus Schuler/Implicator.ai)
https://www.implicator.ai/peter-steinberger-chose-o…

Peter Steinberger Chose OpenAI. The Code Was Never the Point.
OpenClaw creator Peter Steinberger joins OpenAI over Meta. The 196,000-star project's code wasn't the prize. Its adoption graph was.

This graph looks problematic , more people should be worried about this 🤔 , what does a rise in GDP even mean with this distribution?
#economy #usa

The rewrite of the Sisyphus server continues, I've got all of the GET endpoints and about 60% of all the endpoints finished overall. Some initial testing on the `/workers` and `/queue` endpoints show some worrying results from the old version and some great results from the new version. The `/workers` endpoint started throwing errors at about 800 RPS on the Python/Flask version (the old one), the rewrite is showing around 4800 RPS (Golang/Gin). The `/queue` endpoint doesn't show a…

A Knaster--Reichbach type theorem for graph structures
Wies{\l}aw Kubi\'s, Andrzej Kucharski, S{\l}awomir Turek
https://arxiv.org/abs/2602.15696 https://

epsteinvisualizer.com - a graph explorer of the Epstein emails #Epstein https://rmendes.net/content/bookmarks/2026-02-04-epsteinvisualizer-com-a-graph-explorer-…

epsteinvisualizer.com - a graph explorer of the Epstein emails #Epstein
epsteinvisualizer.com - a graph explorer of the Epstein emails #Epstein 4 February 2026 Epstein 🔖 https://epsteinvisualizer.com/ - Alternative URL : https://epstein-doc-explorer-1.onrender.com/ Alter...

In my personality-horoscope, I achieved 100% introvert for the first time!
https://www.16personalities.com/

1.7x speedup on the 100baseT1 decode from doing the PAM3 demodulation (but not the descrambling) in a shader.
Now the whole baseT1 demo is running at about 8 WFM/s, with a roughly 125ms filter graph execution time (on 80ms of waveform data, so real time would be 12.5 WFM/s)
This breaks down (roughly, not exact due to parallel execution) to:
* 1.3 ms subtract diffpair legs
* 10.6 ms de-embed directional coupler
* 0.6 ms equalization
* 7.5 ms upsample
* 14…

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

❓Wie können Musikwissenschaftler:innen mit einem Knowledge Graph interagieren und relevante Informationen abrufen, ohne SPARQL-Expert:innen zu sein?
🤩 Wir freuen uns diese Frage mit euch im Rahmen einer Data Challenge zu diskutieren!✨Und in Kooperation mit dem @…
✨ From Notes to Nodes – Develop an AI-driven explor…

In defense of Reviewer 2.
Dear Reviewer 2: Reviewers 1 and 3 snarked uselessly. You, however, did a damn fine job giving me actionable changes, sight reading the missing recall stat from my own graph, pointing out what it meant to my theory, and making my work better. Thank you.
Love, someone going to the conference and who has a brand new peer-reviewed publication thanks to your "weak accept". I ain't proud; I'll take it.

notre_dame_web: Webgraph (Notre Dame)
The web graph of Notre Dame University (nd.edu), as collected in 1999.
This network has 325729 nodes and 1497134 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/notre_dame_web
Ridiculogram…

Fun observation from a year of my UPS load graph; while it's very noisy, that big drop in November is when I reinstalled it with a newer OS version and rebuilt the whole installation; so it made a noticeable difference! I'm not sure of the actual power - this UPS only gives me a percentage and it's very rough anyway, So I suspect just a watt or two, maybe clearing out old cron's and having a newer kernel is worth it!

Wenn Google deine Marke nicht als Entity kennt, bist du im Knowledge Graph unsichtbar. 🧩Und damit auch in Brand-SERPs, AI Overviews und LLM-Antworten.
Der schnellste Weg, eine Entity zu etablieren: Wikidata-Eintrag, konsistente sameAs-Verweise im Schema Markup, und Erwähnungen auf Seiten, die Google bereits als Entities führt.
Kein Backlink-Building. Entity-Building. Das ist der Unterschied, der 2026 zählt.

internet_top_pop: Internet topology (PoP level) (1969-2012)
Assorted snapshots of internet graph at the Point of Presence (PoP) level (which lies between the IP and AS levels), collected from around the world and at various times. The earliest snapshots are for ARPANET (1969-1972), with a few more from pre-2000. Most are from 2006 onward. Metadata include link type or speed, longitudes, and latitudes of nodes, URL, and date of record.
This network has 22 nodes and 24 edges.

Neighborhood-Aware Graph Labeling Problem
Mohammad Shahverdikondori, Sepehr Elahi, Patrick Thiran, Negar Kiyavash
https://arxiv.org/abs/2602.08098 https://arxiv.org/pdf/2602.08098 https://arxiv.org/html/2602.08098
arXiv:2602.08098v1 Announce Type: new
Abstract: Motivated by optimization oracles in bandits with network interference, we study the Neighborhood-Aware Graph Labeling (NAGL) problem. Given a graph $G = (V,E)$, a label set of size $L$, and local reward functions $f_v$ accessed via evaluation oracles, the objective is to assign labels to maximize $\sum_{v \in V} f_v(x_{N[v]})$, where each term depends on the closed neighborhood of $v$. Two vertices co-occur in some neighborhood term exactly when their distance in $G$ is at most $2$, so the dependency graph is the squared graph $G^2$ and $\mathrm{tw}(G^2)$ governs exact algorithms and matching fine-grained lower bounds. Accordingly, we show that this dependence is inherent: NAGL is NP-hard even on star graphs with binary labels and, assuming SETH, admits no $(L-\varepsilon)^{\mathrm{tw}(G^2)}\cdot n^{O(1)}$-time algorithm for any $\varepsilon>0$. We match this with an exact dynamic program on a tree decomposition of $G^2$ running in $O\!\left(n\cdot \mathrm{tw}(G^2)\cdot L^{\mathrm{tw}(G^2) 1}\right)$ time. For approximation, unless $\mathsf{P}=\mathsf{NP}$, for every $\varepsilon>0$ there is no polynomial-time $n^{1-\varepsilon}$-approximation on general graphs even under the promise $\mathrm{OPT}>0$; without the promise $\mathrm{OPT}>0$, no finite multiplicative approximation ratio is possible. In the nonnegative-reward regime, we give polynomial-time approximation algorithms for NAGL in two settings: (i) given a proper $q$-coloring of $G^2$, we obtain a $1/q$-approximation; and (ii) on planar graphs of bounded maximum degree, we develop a Baker-type polynomial-time approximation scheme (PTAS), which becomes an efficient PTAS (EPTAS) when $L$ is constant.
toXiv_bot_toot

from my link log —
The acyclic e-graph: Cranelift's mid-end optimizer.
https://cfallin.org/blog/2026/04/09/aegraph/
saved 2026-04-10 https://

Axel Springer says it received approval from the UK Department for Culture, Media, and Sport to proceed with its £575M deal to acquire the Telegraph Media Group (Ali Lyon/City A.M.)
https://www.cityam.com/axel-springers-telegraph-takeover-given-governme…

Axel Springer’s Telegraph takeover given government green light
The years-long saga over the Daily Telegraph ownership is nearing a conclusion, after the government approved Axel Springer's £575m bid.

Telegraph has a story claiming that the UK gas reserves are about to run out:
> “The UK’s gas reserves have shrunk from 18,000 GWh worth last year to 6,700 GWh – enough for just 1.5 days of demand”
And that piece maybe could have used a graph? Based on data.nationalgas.com the difference is between the blue (last year) and green (this year) lines on the rightmost edge of this graph:

Globally January was the fifth-warmest January on record, 0.28°C cooler than the warmest January on record in 2025.
It was 1.47°C warmer than the estimated pre-industrial January average for 1850-1900.
@copernicusecmwf.bsky.social
https://climate.copernicus.eu/surface-

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, Unweighted
https://

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
Yu-Sheng Shih, Meng-Tsung Tsai, Yen-Chu Tsai, Ying-Sian Wu
https://arxiv.org/abs/2602.08002 https://arxiv.org/pdf/2602.08002 https://arxiv.org/html/2602.08002
arXiv:2602.08002v1 Announce Type: new
Abstract: We study the space complexity of four variants of the standard subgraph finding problem in the streaming model. Specifically, given an $n$-vertex input graph and a fixed-size pattern graph, we consider two settings: undirected simple graphs, denoted by $G$ and $H$, and oriented graphs, denoted by $\vec{G}$ and $\vec{H}$. Depending on the setting, the task is to decide whether $G$ contains $H$ as a subgraph or as an induced subgraph, or whether $\vec{G}$ contains $\vec{H}$ as a subgraph or as an induced subgraph. Let Sub$(H)$, IndSub$(H)$, Sub$(\vec{H})$, and IndSub$(\vec{H})$ denote these four variants, respectively.
An oriented graph is well-oriented if it admits a bipartition in which every arc is oriented from one part to the other, and a vertex is non-well-oriented if both its in-degree and out-degree are non-zero. For each variant, we obtain a complete dichotomy theorem, briefly summarized as follows.
(1) Sub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H$ is bipartite.
(2) IndSub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H \in \{P_3, P_4, co\mbox{-}P_3\}$.
(3) Sub$(\vec{H})$ can be solved by a single-pass $n^{2-\Omega(1)}$-space algorithm if and only if every connected component of $\vec H$ is either a well-oriented bipartite graph or a tree containing at most one non-well-oriented vertex.
(4) IndSub$(\vec{H})$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if the underlying undirected simple graph $H$ is a $co\mbox{-}P_3$.
toXiv_bot_toot

Started collecting some performance data on ngscopeclient filters as I go through and optimize/refactor.
This is nowhere near the entire filter suite, and a few rows are missing data right now.
8B/10B is still running on the CPU, as you can probably guess from the abysmal throughput, but I had it in one of my test filter graphs so I included the data.

Western countries announced a record release of oil from their strategic reserves yesterday: 40% of the reserves in the US, 30% for IEA as a whole.
Yet, burning tankers in the Gulf pushed up the oil price in the night. This ain't over yet.

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 93708 edges.
Tags: Biolo…

internet_top_pop: Internet topology (PoP level) (1969-2012)
Assorted snapshots of internet graph at the Point of Presence (PoP) level (which lies between the IP and AS levels), collected from around the world and at various times. The earliest snapshots are for ARPANET (1969-1972), with a few more from pre-2000. Most are from 2006 onward. Metadata include link type or speed, longitudes, and latitudes of nodes, URL, and date of record.
This network has 50 nodes and 73 edges.

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net…

Saudi oil production down by 3.5 million barrels/day due to the Trump-Netanyahu war against Iran. Puts the OPEC decision to raise the ceiling for May by 0.2 million barrels/day in perspective.
https://www.volkskrant.nl/binnenland/oliep

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

google: Google internal webpages (2007)
A directed network of webpages from Google's own sites, and the hyperlinks among them. Edge direction indicates that i hyperlinks to j.
This network has 15763 nodes and 171206 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 24913 nodes and 197952 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net…

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 136014 nodes and 4919249 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/n…

polblogs: Political blogs network (2004)
A directed network of hyperlinks among a large set of U.S. political weblogs from before the 2004 election. Includes blog political affiliation as metadata.
This network has 1490 nodes and 19090 edges.
Tags: Informational, Web graph, Unweighted, Metadata
https://networks.skewed.d…

wikipedia_growth: en-Wikipedia links (2007)
The network of hyperlinks among English wikipedia pages, in 2007. An edge (i,j) indicates that article i hyperlinks to article j, and each edge is timestamped with its creation.
This network has 1870709 nodes and 39953145 edges.
Tags: Informational, Web graph, Unweighted, Timestamps
https:/…

wikipedia_growth: en-Wikipedia links (2007)
The network of hyperlinks among English wikipedia pages, in 2007. An edge (i,j) indicates that article i hyperlinks to article j, and each edge is timestamped with its creation.
This network has 1870709 nodes and 39953145 edges.
Tags: Informational, Web graph, Unweighted, Timestamps
https:/…

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 26197 nodes and 28980 edges.

edit_wikinews: Wikipedia news edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about news events. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 11942 nodes and 125869 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

edit_wiktionary: Wiktionary edits (2010)
Three bipartite user-page networks extracted from Wiktionary, for French, German, and English. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 103 nodes and 98 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

student_cooperation: Student cooperation (2012)
Network of cooperation among students in the "Computer and Network Security" course at Ben-Gurion University, in 2012. Nodes are students, and edges denote cooperation between students while doing their homework. The graph contains three types of links: Time, Computer, Partners.
This network has 185 nodes and 360 edges.
Tags: Social, Offline, Multigraph, Unweighted

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/s…

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

notre_dame_web: Webgraph (Notre Dame)
The web graph of Notre Dame University (nd.edu), as collected in 1999.
This network has 325729 nodes and 1497134 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/notre_dame_web
Ridiculogram…

dblp_coauthor_snap: DBLP authors (2012)
A coauthorship network extracted from the DBLP computer science manuscript database, in 2012. This network is a one-mode projection from the bipartite graph of computer scientists and their publications.
This network has 425957 nodes and 1049866 edges.
Tags: Social, Collaboration, Unweighted, Metadata, Projection

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 68746 nodes and 51971 edges.

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 80270 edges.
Tags: Biolo…

topology: Internet AS graph (2004)
An integrated snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from multiple sources, including the RouteViews and RIPE BGP trace collectors, route servers, looking glasses, and the Internet Routing Registry databases. This snapshot was created around October 2004.
This network has 34761 nodes and 171403 edges.
Tags: Technological, Communication, Unweighted, Multigraph, Timestamps

google: Google internal webpages (2007)
A directed network of webpages from Google's own sites, and the hyperlinks among them. Edge direction indicates that i hyperlinks to j.
This network has 15763 nodes and 171206 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google

polblogs: Political blogs network (2004)
A directed network of hyperlinks among a large set of U.S. political weblogs from before the 2004 election. Includes blog political affiliation as metadata.
This network has 1490 nodes and 19090 edges.
Tags: Informational, Web graph, Unweighted, Metadata
https://networks.skewed.d…

dblp_coauthor_snap: DBLP authors (2012)
A coauthorship network extracted from the DBLP computer science manuscript database, in 2012. This network is a one-mode projection from the bipartite graph of computer scientists and their publications.
This network has 425957 nodes and 1049866 edges.
Tags: Social, Collaboration, Unweighted, Metadata, Projection

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 133280 nodes and 396160 edges.

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://netwo…

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web<…

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 68746 nodes and 51971 edges.

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, Unweighted
https://

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://…

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, Unweighted
https://

netscience: Scientific collaborations in network science (2006)
A coauthorship network among scientists working on network science, from 2006. This network is a one-mode projection from the bipartite graph of authors and their scientific publications.
This network has 1589 nodes and 2742 edges.
Tags: Social, Collaboration, Weighted, Projection

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://

wikipedia_growth: en-Wikipedia links (2007)
The network of hyperlinks among English wikipedia pages, in 2007. An edge (i,j) indicates that article i hyperlinks to article j, and each edge is timestamped with its creation.
This network has 1870709 nodes and 39953145 edges.
Tags: Informational, Web graph, Unweighted, Timestamps
https:/…

edit_wikibooks: Wikipedia book edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about books. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 300 nodes and 414 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 89209 nodes and 237010 edges.

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

google_web: Old Google web graph (2002)
A web graph representing a crawl of a portion of the general WWW, from a 2002 Google Programming contest.
This network has 916428 nodes and 5105039 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google_web

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/s…

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
https://

internet_top_pop: Internet topology (PoP level) (1969-2012)
Assorted snapshots of internet graph at the Point of Presence (PoP) level (which lies between the IP and AS levels), collected from around the world and at various times. The earliest snapshots are for ARPANET (1969-1972), with a few more from pre-2000. Most are from 2006 onward. Metadata include link type or speed, longitudes, and latitudes of nodes, URL, and date of record.
This network has 88 nodes and 92 edges.

notre_dame_web: Webgraph (Notre Dame)
The web graph of Notre Dame University (nd.edu), as collected in 1999.
This network has 325729 nodes and 1497134 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/notre_dame_web
Ridiculogram…

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/s…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 10285 nodes and 180916 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/ne…