Tootfinder

@netzschleuder@social.skewed.de
2026-02-27 05:00:49

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

yahoo_song: Yahoo song ratings (2011). 1625951 nodes, 256804235 edges. https://networks.skewed.de/net/yahoo_song

@netzschleuder@social.skewed.de
2026-02-26 16:00:04

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis: Les Misérables coappearances. 77 nodes, 254 edges. https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2026-02-23 18:00:04

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2026-01-23 00:00:04

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2026-02-22 17:00:04

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

student_cooperation: Student cooperation (2012). 185 nodes, 360 edges. https://networks.skewed.de/net/student_cooperation

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.

@netzschleuder@social.skewed.de
2026-01-22 10:00:03

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

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.

@netzschleuder@social.skewed.de
2026-02-21 17:00:04

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

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.

@arXiv_csDS_bot@mastoxiv.page
2026-02-10 09:45:25

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

@netzschleuder@social.skewed.de
2025-12-19 20:00:03

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2025-12-23 07:00:53

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2026-02-17 12:00:04

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

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.

@netzschleuder@social.skewed.de
2026-02-21 22:00:47

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2026-02-15 06:00:04

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2026-02-14 12:00:04

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@arXiv_csDS_bot@mastoxiv.page
2026-02-03 07:35:01

End Cover for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
Bingwei Zhang, Chee Yap
https://arxiv.org/abs/2602.00162 https://arxiv.org/pdf/2602.00162 https://arxiv.org/html/2602.00162
arXiv:2602.00162v1 Announce Type: new
Abstract: We consider the first-order autonomous ordinary differential equation \[ \mathbf{x}' = \mathbf{f}(\mathbf{x}), \] where $\mathbf{f} : \mathbb{R}^n \to \mathbb{R}^n$ is locally Lipschitz. For a box $B_0 \subseteq \mathbb{R}^n$ and $h > 0$, we denote by $\mathrm{IVP}_{\mathbf{f}}(B_0,h)$ the set of solutions $\mathbf{x} : [0,h] \to \mathbb{R}^n$ satisfying \[ \mathbf{x}'(t) = \mathbf{f}(\mathbf{x}(t)), \qquad \mathbf{x}(0) \in B_0 . \]
We present a complete validated algorithm for the following \emph{End Cover Problem}: given $(\mathbf{f}, B_0, \varepsilon, h)$, compute a finite set $\mathcal{C}$ of boxes such that \[ \mathrm{End}_{\mathbf{f}}(B_0,h) \;\subseteq\; \bigcup_{B \in \mathcal{C}} B \;\subseteq\; \mathrm{End}_{\mathbf{f}}(B_0,h) \oplus [-\varepsilon,\varepsilon]^n , \] where \[ \mathrm{End}_{\mathbf{f}}(B_0,h) = \left\{ \mathbf{x}(h) : \mathbf{x} \in \mathrm{IVP}_{\mathbf{f}}(B_0,h) \right\}. \]
Moreover, we provide a complexity analysis of our algorithm and introduce a novel technique for computing the end cover $\mathcal{C}$ based on covering the boundary of $\mathrm{End}_{\mathbf{f}}(B_0,h)$. Finally, we present experimental results demonstrating the practicality of our approach.
toXiv_bot_toot

@netzschleuder@social.skewed.de
2026-01-14 11:00:05

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

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.

@netzschleuder@social.skewed.de
2025-12-19 17:00:50

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2026-02-09 13:00:05

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2026-01-07 13:00:03

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2026-01-17 04:00:45

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2026-02-03 21:00:04

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

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.

@netzschleuder@social.skewed.de
2026-02-04 17:00:04

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

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.

@netzschleuder@social.skewed.de
2026-01-04 04:00:04

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

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.

@netzschleuder@social.skewed.de
2026-01-03 13:00:03

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

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.

@netzschleuder@social.skewed.de
2025-12-02 06:00:04

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2025-12-01 15:00:03

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2025-12-30 21:00:03

lesmis: Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.
This network has 77 nodes and 254 edges.
Tags: Social, Fictional, Weighted
https://networks.skewed.de/net/lesmis

lesmis — Les Misérables coappearances
The network of scene coappearances of characters in Victor Hugo's novel "Les Miserables". Edge weights denote the number of such occurrences.

@netzschleuder@social.skewed.de
2026-01-10 07:00:49

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2026-02-07 10:00:52

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2025-12-01 03:00:47

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2026-01-01 10:00:47

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

@netzschleuder@social.skewed.de
2025-11-30 12:00:48

yahoo_song: Yahoo song ratings (2011)
A bipartite network of users and songs they rated, as used in the 2011 KDD Cup and extracted from Yahoo! Music. Edge weights denote a rating scaled from 0 to 100. More information about this data set is available at http://konect.cc/networks/yahoo-song.
Th…

Tootfinder

Opt-in global Mastodon full text search. Join the index!