Tootfinder

On 16WW Data Collections and Graphs - Open for research home #dataset - https://www.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

Now the US has chosen an admirer of Putin as president, who subsequently halted aid to Ukraine, Europe stepped up, filling most of the gap.
https://www.kielinstitut.de/publications/news/ukraine-support-after-4-years-of-war-europe-steps-up/…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

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.

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
Pan Peng, Yuyang Wang
https://arxiv.org/abs/2602.07394 https://arxiv.org/pdf/2602.07394 https://arxiv.org/html/2602.07394
arXiv:2602.07394v1 Announce Type: new
Abstract: We study \emph{local computation algorithms (LCAs)} for constructing spanning trees. In this setting, the goal is to locally determine, for each edge $ e \in E $, whether it belongs to a spanning tree $ T $ of the input graph $ G $, where $ T $ is defined implicitly by $ G $ and the randomness of the algorithm. It is known that LCAs for spanning trees do not exist in general graphs, even for simple graph families. We identify a natural and well-studied class of graphs -- \emph{expander graphs} -- that do admit \emph{sublinear-time} LCAs for spanning trees. This is perhaps surprising, as previous work on expanders only succeeded in designing LCAs for \emph{sparse spanning subgraphs}, rather than full spanning trees. We design an LCA with probe complexity $ O\left(\sqrt{n}\left(\frac{\log^2 n}{\phi^2} d\right)\right)$ for graphs with conductance at least $ \phi $ and maximum degree at most $ d $ (not necessarily constant), which is nearly optimal when $\phi$ and $d$ are constants, since $\Omega(\sqrt{n})$ probes are necessary even for expanders. Next, we show that for the natural class of \emph{\ER graphs} $ G(n, p) $ with $ np = n^{\delta} $ for any constant $ \delta > 0 $ (which are expanders with high probability), the $ \sqrt{n} $ lower bound can be bypassed. Specifically, we give an \emph{average-case} LCA for such graphs with probe complexity $ \tilde{O}(\sqrt{n^{1 - \delta}})$.
Finally, we extend our techniques to design LCAs for the \emph{minimum spanning tree (MST)} problem on weighted expander graphs. Specifically, given a $d$-regular unweighted graph $\bar{G}$ with sufficiently strong expansion, we consider the weighted graph $G$ obtained by assigning to each edge an independent and uniform random weight from $\{1,\ldots,W\}$, where $W = O(d)$. We show that there exists an LCA that is consistent with an exact MST of $G$, with probe complexity $\tilde{O}(\sqrt{n}d^2)$.
toXiv_bot_toot

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…

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

R CHARTS | A collection of charts and graphs made with the R programming language
Over 1400 graphs with reproducible code divided in 8 big categories and over 50 chart types, in addition of tools to choose and create colors and color palettes

Thinking about future release plans for ngscopeclient.
There have been massive performance improvements and some significant bug fixes since v0.1.1 and the ThunderScope dev edition units are going to manufacture so we'll be getting a lot of additional users in ~2 months.
But there's also a lot of ongoing backend refactoring and changes to filter graph blocks that won't be strictly backwards compatible (old filter graphs will need updating) and while I freely break sof…

Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
Kanstantsin Pashkovich, Thomas Snow
https://arxiv.org/abs/2602.07355 https://arxiv.org/pdf/2602.07355 https://arxiv.org/html/2602.07355
arXiv:2602.07355v1 Announce Type: new
Abstract: We study online algorithms for maximum cardinality matchings with edge arrivals in graphs of low degree. Buchbinder, Segev, and Tkach showed that no online algorithm for maximum cardinality fractional matchings can achieve a competitive ratio larger than $4/(9-\sqrt 5)\approx 0.5914$ even for graphs of maximum degree three. The negative result of Buchbinder et al. holds even when the graph is bipartite and edges are revealed according to vertex arrivals, i.e. once a vertex arrives, all edges are revealed that include the newly arrived vertex and one of the previously arrived vertices. In this work, we complement the negative result of Buchbinder et al. by providing an online algorithm for maximum cardinality fractional matchings with a competitive ratio at least $4/(9-\sqrt 5)\approx 0.5914$ for graphs of maximum degree three. We also demonstrate that no online algorithm for maximum cardinality integral matchings can have the competitive guarantee $0.5807$, establishing a gap between integral and fractional matchings for graphs of maximum degree three. Note that the work of Buchbinder et al. shows that for graphs of maximum degree two, there is no such gap between fractional and integral matchings, because for both of them the best achievable competitive ratio is $2/3$. Also, our results demonstrate that for graphs of maximum degree three best possible competitive ratios for fractional matchings are the same in the vertex arrival and in the edge arrival models.
toXiv_bot_toot

State of AI safety: as capabilities grow and models can monitor other models, issues like adversarial robustness persist and society is still not ready for AI (Boaz Barak/Windows On Theory)
https://windowsontheory.org/2026/03/30/the-state-of-ai-safety-in-fo…

The state of AI safety in four fake graphs
Here is a quick overview of my intuitions on where we are with AI safety in early 2026: So far, we continue to see exponential improvements in capabilities. This is most visible in the famous “METR…

Characterization of Some Graphs Realizing Regularity Bounds for Binomial Edge Ideals
Nursel Erey, Muhammed Ergen, Takayuki Hibi
https://arxiv.org/abs/2602.06524 https://arxiv.org/pdf/2602.06524 https://arxiv.org/html/2602.06524
arXiv:2602.06524v1 Announce Type: new
Abstract: In this paper, we characterize all graphs $G$ satisfying \[\operatorname{reg}(S/J_G)=\ell(G)=c(G)\] where $\ell(G)$ is the sum of the lengths of the longest induced paths in each connected component of $G$ and $c(G)$ is the number of the maximal cliques of $G$. We also characterize all connected graphs $G$ that satisfy \[\operatorname{reg}(S/J_G)=\ell(G)=|V(G)|-\omega(G) 1\] where $\omega(G)$ is the clique number of $G$. Moreover, we investigate the possible values of the regularity of $S/J_G$ within the intervals $[\ell(G), c(G)]$ and $[\ell(G), |V(G)|-\omega(G) 1]$.
toXiv_bot_toot

from my link log —
One hundred curl graphs.
https://daniel.haxx.se/blog/2026/03/15/one-hundred-curl-graphs/
saved 2026-03-15 https://

One hundred curl graphs
In the spring of 2020 I decided to finally do something about the lack of visualizations for how the curl project is performing, development wise. How does the line of code growth look like? How many command line options have we had over time and how many people have done more than 10 commits per … Continue reading One hundred curl graphs →

On 16WW Data Collections and Graphs - Open for research home #dataset - https://m.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…

Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
https://arxiv.org/abs/2602.08542 https://arxiv.org/pdf/2602.08542 https://arxiv.org/html/2602.08542
arXiv:2602.08542v1 Announce Type: new
Abstract: Given a weighted undirected graph, a number of clusters $k$, and an exponent $z$, the goal in the $(k, z)$-clustering problem on graphs is to select $k$ vertices as centers that minimize the sum of the distances raised to the power $z$ of each vertex to its closest center. In the dynamic setting, the graph is subject to adversarial edge updates, and the goal is to maintain explicitly an exact $(k, z)$-clustering solution in the induced shortest-path metric.
While efficient dynamic $k$-center approximation algorithms on graphs exist [Cruciani et al. SODA 2024], to the best of our knowledge, no prior work provides similar results for the dynamic $(k,z)$-clustering problem. As the main result of this paper, we develop a randomized incremental $(k, z)$-clustering algorithm that maintains with high probability a constant-factor approximation in a graph undergoing edge insertions with a total update time of $\tilde O(k m^{1 o(1)} k^{1 \frac{1}{\lambda}} m)$, where $\lambda \geq 1$ is an arbitrary fixed constant. Our incremental algorithm consists of two stages. In the first stage, we maintain a constant-factor bicriteria approximate solution of size $\tilde{O}(k)$ with a total update time of $m^{1 o(1)}$ over all adversarial edge insertions. This first stage is an intricate adaptation of the bicriteria approximation algorithm by Mettu and Plaxton [Machine Learning 2004] to incremental graphs. One of our key technical results is that the radii in their algorithm can be assumed to be non-decreasing while the approximation ratio remains constant, a property that may be of independent interest.
In the second stage, we maintain a constant-factor approximate $(k,z)$-clustering solution on a dynamic weighted instance induced by the bicriteria approximate solution. For this subproblem, we employ a dynamic spanner algorithm together with a static $(k,z)$-clustering algorithm.
toXiv_bot_toot

Bar plots like these may raise more questions than answers.
Without any y-axis label what are we to make of this? We don't really have a sense of scale.
Are two months on the x-axis long enough to show correlation or just coincidence?
They show graphs only for select neighbor countries all with a spike on or around around 3/1. What about non-neighbor countries? Could this have been a global phenomenon?
Don't want to pick on the source (in the image alt text)…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

Quantum Graph Theory by Example
Gian Luca Spitzer, Ion Nechita
https://arxiv.org/abs/2603.23651 https://arxiv.org/pdf/2603.23651 https://arxiv.org/html/2603.23651
arXiv:2603.23651v1 Announce Type: new
Abstract: Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in working with quantum graphs compared to classical graphs stems from the fact that they are no longer discrete objects. This makes it generally difficult to construct insightful, non-trivial examples. We present a collection of non-trivial quantum graphs that can be thought of in discrete terms, and that can be expressed in the diagrammatic formalism introduced by Musto, Reutter, and Verdon. The examples arise as the quantum graphs acted on by increasingly smaller classical matrix groups, and are parametrised by triples of matrices $(A, B, C)$. The parametrisation reveals a clean decomposition of quantum graph structure into classical and genuinely quantum components: $A$ and $C$ are described by a classical weighted graph called the strange graph, while $B$ provides a purely quantum contribution with no classical analogue. Based on this model, we give exact formulas or establish bounds for quantum graph parameters, such as the number of connected components, the chromatic number, the independence number, and the clique number. Our results provide the first large, parametric families of quantum graphs for which standard graph parameters can be computed analytically.
toXiv_bot_toot

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
Wojciech Gabryelski, Zbigniew Go{\l}\c{e}biewski, Martin P\'epin
https://arxiv.org/abs/2602.08471 https://arxiv.org/pdf/2602.08471 https://arxiv.org/html/2602.08471
arXiv:2602.08471v1 Announce Type: new
Abstract: We propose two efficient algorithms for generating uniform random directed acyclic graphs, including an asymptotically optimal exact-size sampler that performs $\frac{n^2}{2} o(n^2)$ operations and requests to a random generator. This was achieved by extending the Boltzmann model for graphical generating functions and by using various decompositions of directed acyclic graphs. The presented samplers improve upon the state-of-the-art algorithms in terms of theoretical complexity and offer a significant speed-up in practice.
toXiv_bot_toot

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 5722 nodes and 12080 edges.
Tags: Technological, Communication, Unweighted, Temporal

It will probably be a month or so before the house reaches the true neutral energy cost. However I had the first free tank of hot water today. About 4kWh of excess #solargeneration went into the hot water and almost 6kWh to the grid.
#graphs

Live Telemetry as they approach the Loss of Signal and go behind the moon — #earthset

I'm trying to understand why these graphs do not match:
#fediverse #mastodon

On 16WW Data Collections and Graphs - Open for research home #dataset - https://www.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…

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

Analytic structure of $q$-pseudoconcave subsets of continuous graphs
Filippo Valnegri
https://arxiv.org/abs/2603.04967 https://arxiv.org/pdf/2603.04967

When I was in my early twenties I read The Visual Display of Quantitative Information from Tufte and agonized over making charts great for users.
These days, Microsoft releases graphs like this

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 5539 nodes and 11720 edges.
Tags: Technological, Communication, Unweighted, Temporal

Global renewable power capacity crossed the 5 TW (that's 5,000,000,000,000 Watts) mark last year!
It grew by 15.5 % within one year, driven by solar PV and wind.
From IRENA:
https://www.irena.org/News/pressreleases/2

TIEG-Youpu Solution for NeurIPS 2022 WikiKG90Mv2-LSC
Feng Nie, Zhixiu Ye, Sifa Xie, Shuang Wu, Xin Yuan, Liang Yao, Jiazhen Peng, Xu Cheng
https://arxiv.org/abs/2603.28512 https://arxiv.org/pdf/2603.28512 https://arxiv.org/html/2603.28512
arXiv:2603.28512v1 Announce Type: new
Abstract: WikiKG90Mv2 in NeurIPS 2022 is a large encyclopedic knowledge graph. Embedding knowledge graphs into continuous vector spaces is important for many practical applications, such as knowledge acquisition, question answering, and recommendation systems. Compared to existing knowledge graphs, WikiKG90Mv2 is a large scale knowledge graph, which is composed of more than 90 millions of entities. Both efficiency and accuracy should be considered when building graph embedding models for knowledge graph at scale. To this end, we follow the retrieve then re-rank pipeline, and make novel modifications in both retrieval and re-ranking stage. Specifically, we propose a priority infilling retrieval model to obtain candidates that are structurally and semantically similar. Then we propose an ensemble based re-ranking model with neighbor enhanced representations to produce final link prediction results among retrieved candidates. Experimental results show that our proposed method outperforms existing baseline methods and improves MRR of validation set from 0.2342 to 0.2839.
toXiv_bot_toot

Sheaves on Graphs and their Differential Calculi
Rita Fioresi, Angelica Simonetti, Ferdinando Zanchetta
https://arxiv.org/abs/2602.21176 https://arxiv.org/pdf/2602.21176 https://arxiv.org/html/2602.21176
arXiv:2602.21176v1 Announce Type: new
Abstract: In this paper we explore the link between the theory of sheaves on graphs and noncommutative geometry showing that many concepts and constructions in the latter can be generalized and enhanced using methods coming from the former. They include notions such as Laplacians and connections, important in the theory of discrete noncommutative geometry, that are here explored with sheaf theoretic methods and using the language of (semi)simplicial sets.
toXiv_bot_toot

On 16WW Data Collections and Graphs - Open for research home #dataset - https://www.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

Using fonts in R graphics can be tricky at times. {showtext} aims to make it easier: #rstats

Directed strongly regular graphs and divisible design graphs from Tatra association schemes
Mikhail Muzychuk, Grigory Ryabov
https://arxiv.org/abs/2601.09955 https://

Probing Graph Neural Network Activation Patterns Through Graph Topology
Floriano Tori, Lorenzo Bini, Marco Sorbi, St\'ephane Marchand-Maillet, Vincent Ginis
https://arxiv.org/abs/2602.21092 https://arxiv.org/pdf/2602.21092 https://arxiv.org/html/2602.21092
arXiv:2602.21092v1 Announce Type: new
Abstract: Curvature notions on graphs provide a theoretical description of graph topology, highlighting bottlenecks and denser connected regions. Artifacts of the message passing paradigm in Graph Neural Networks, such as oversmoothing and oversquashing, have been attributed to these regions. However, it remains unclear how the topology of a graph interacts with the learned preferences of GNNs. Through Massive Activations, which correspond to extreme edge activation values in Graph Transformers, we probe this correspondence. Our findings on synthetic graphs and molecular benchmarks reveal that MAs do not preferentially concentrate on curvature extremes, despite their theoretical link to information flow. On the Long Range Graph Benchmark, we identify a systemic \textit{curvature shift}: global attention mechanisms exacerbate topological bottlenecks, drastically increasing the prevalence of negative curvature. Our work reframes curvature as a diagnostic probe for understanding when and why graph learning fails.
toXiv_bot_toot

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…

Just fixed an interesting and subtle shader performance bug.
Here I'm trying to recover a clock from a PAM-3 signal which consists of two consecutive filter blocks: the PAM edge detector (find level crossings and interpolate, accounting for the fact that the threshold changes depending on start/end symbol), and then the CDR PLL proper.
If you're not familiar with NSight Systems especially on complex multithreaded applications, there's a lot going on here even though I…

A Faster Directed Single-Source Shortest Path Algorithm
Ran Duan, Xiao Mao, Xinkai Shu, Longhui Yin
https://arxiv.org/abs/2602.07868 https://arxiv.org/pdf/2602.07868 https://arxiv.org/html/2602.07868
arXiv:2602.07868v1 Announce Type: new
Abstract: This paper presents a new deterministic algorithm for single-source shortest paths (SSSP) on real non-negative edge-weighted directed graphs, with running time $O(m\sqrt{\log n} \sqrt{mn\log n\log \log n})$, which is $O(m\sqrt{\log n\log \log n})$ for sparse graphs. This improves the recent breakthrough result of $O(m\log^{2/3} n)$ time for directed SSSP algorithm [Duan, Mao, Mao, Shu, Yin 2025].
toXiv_bot_toot

Continuing in the process of measuring the speed of my turntable in the oddest way; here is the FFT before and after oiling & replacing it's belt. Hmm, it's clearly a bit fast before and a bit slow after; it's not got any speed adjustment mechanism, it's a belt on an AC driven motor.
This FFT and plot was done using #labplot using the waveforms gathered by

Proximity Alert: Ipelets for Neighborhood Graphs and Clustering
Gitan Balogh, June Cagan, Bea Fatima, Auguste H. Gezalyan, Danesh Sivakumar, Arushi Srinivasan, Yixuan Sun, Vahe Zaprosyan, David M. Mount
https://arxiv.org/abs/2603.27023

Crosslisted article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David Manlove, Fabricio Mendoza, Dani\"el Paulusma

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

Nice graphs from JP Morgan about the energy crisis around Hormuz, war against Iran.
#iran #hormuz #oil #usa

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3087 nodes and 5663 edges.
Tags: Technological, Communication, Unweighted, Temporal

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Language Generation in the Limit: Noise, Loss, and Feedback
Yannan Bai, Debmalya Panigrahi, Ian Zhang
https://arxiv.org/abs/2507.15319 https://mastoxiv.page/@arXiv_csDS_bot/114896208560390692
- Online Firefighting on Cactus Graphs
Max Hugen, Bob Krekelberg, Alison Hsiang-Hsuan Liu
https://arxiv.org/abs/2509.22277 https://mastoxiv.page/@arXiv_csDS_bot/115286656155128312
- Improved Extended Regular Expression Matching
Philip Bille, Inge Li G{\o}rtz, Rikke Schjeldrup Jessen
https://arxiv.org/abs/2510.09311 https://mastoxiv.page/@arXiv_csDS_bot/115365884736976741
- Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
Andreas G\"obel, Janosch Ruff, Leon Schiller
https://arxiv.org/abs/2511.20376 https://mastoxiv.page/@arXiv_csDS_bot/115614988823215273
- Analysis of Shuffling Beyond Pure Local Differential Privacy
Shun Takagi, Seng Pei Liew
https://arxiv.org/abs/2601.19154 https://mastoxiv.page/@arXiv_csDS_bot/115971701218309765
- Exact (n 2) Comparison Complexity for the N-Repeated Element Problem
Andrew Au
https://arxiv.org/abs/2601.21202 https://mastoxiv.page/@arXiv_csDS_bot/115982906572495225
- A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
Pedro Valdeira, Yuejie Chi, Cl\'audia Soares, Jo\~ao Xavier
https://arxiv.org/abs/2309.09977
- Optimal Sequential Flows
Hugo Gimbert, Corto Mascle, Patrick Totzke
https://arxiv.org/abs/2511.13806 https://mastoxiv.page/@arXiv_mathOC_bot/115575399809016779
toXiv_bot_toot

Determining the normal subgroups of the automorphism groups of some ultrahomogeneous structures via stabilisers
Thomas Bernert, Rob Sullivan, Jeroen Winkel, Shujie Yang
https://arxiv.org/abs/2603.27890 https://arxiv.org/pdf/2603.27890 https://arxiv.org/html/2603.27890
arXiv:2603.27890v1 Announce Type: new
Abstract: We show the simplicity of the automorphism groups of the generic $n$-hypertournament and the semigeneric tournament, and determine the normal subgroups of the automorphism groups of several other ultrahomogeneous oriented graphs. We also give a new proof of the simplicity of the automorphism group of the dense $\frac{2\pi}{n}$-local order $\mathbb{S}(n)$ for $n \geq 2$ (a result due to Droste, Giraudet and Macpherson). Previous techniques of Li, Macpherson, Tent and Ziegler involving stationary weak independence relations (SWIRs) cannot be applied directly to these structures; our approach involves applying these techniques to a certain expansion of each structure, where the expansion has a SWIR and its automorphism group is isomorphic to a stabiliser subgroup of the automorphism group of the original structure.
toXiv_bot_toot

On 16WW Data Collections and Graphs - Open for research home #dataset - https://m.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4951 nodes and 10416 edges.
Tags: Technological, Communication, Unweighted, Temporal

Replaced article(s) found for math.GN. https://arxiv.org/list/math.GN/new
[1/1]:
- Fundamental examples of Reeb spaces of smooth functions defined from two graphs of smooth functio...
Naoki Kitazawa

Crosslisted article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Electric Teichm\"uller spaces and $k$-multicurve graphs
Kento Sakai
h…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 434 nodes and 30462 edges.
Tags: Informational, Web gr…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

Prune, Don't Rebuild: Efficiently Tuning $\alpha$-Reachable Graphs for Nearest Neighbor Search
Tian Zhang, Ashwin Padaki, Jiaming Liang, Zack Ives, Erik Waingarten
https://arxiv.org/abs/2602.08097 https://arxiv.org/pdf/2602.08097 https://arxiv.org/html/2602.08097
arXiv:2602.08097v1 Announce Type: new
Abstract: Vector similarity search is an essential primitive in modern AI and ML applications. Most vector databases adopt graph-based approximate nearest neighbor (ANN) search algorithms, such as DiskANN (Subramanya et al., 2019), which have demonstrated state-of-the-art empirical performance. DiskANN's graph construction is governed by a reachability parameter $\alpha$, which gives a trade-off between construction time, query time, and accuracy. However, adaptively tuning this trade-off typically requires rebuilding the index for different $\alpha$ values, which is prohibitive at scale. In this work, we propose RP-Tuning, an efficient post-hoc routine, based on DiskANN's pruning step, to adjust the $\alpha$ parameter without reconstructing the full index. Within the $\alpha$-reachability framework of prior theoretical works (Indyk and Xu, 2023; Gollapudi et al., 2025), we prove that pruning an initially $\alpha$-reachable graph with RP-Tuning preserves worst-case reachability guarantees in general metrics and improved guarantees in Euclidean metrics. Empirically, we show that RP-Tuning accelerates DiskANN tuning on four public datasets by up to $43\times$ with negligible overhead.
toXiv_bot_toot

On 16WW Data Collections and Graphs - Open for research home #dataset - https://www.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3258 nodes and 6185 edges.
Tags: Technological, Communication, Unweighted, Temporal

Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Graph-Based Nearest-Neighbor Search without the Spread
Jeff Giliberti, Sariel Har-Peled, Jonas Sauer, Ali Vakilian
https://arxiv.org/abs/2602.06633 https://mastoxiv.page/@arXiv_csCG_bot/116039510003959758
- Tensor Hinted Mv Conjectures
Zhao Song
https://arxiv.org/abs/2602.07242 https://mastoxiv.page/@arXiv_csCC_bot/116045166832661818
- Compact Conformal Subgraphs
Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala, Aravindan Vijayaraghavan
https://arxiv.org/abs/2602.07530 https://mastoxiv.page/@arXiv_csLG_bot/116046310688959095
- The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching...
Jan Dreier, Nikolas M\"ahlmann, Sebastian Siebertz
https://arxiv.org/abs/2602.07606 https://mastoxiv.page/@arXiv_csCC_bot/116045172877973476
- A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
Owen Shen, Haoran Xu, Yinyu Ye, Peter Glynn, Patrick Jaillet
https://arxiv.org/abs/2602.07663 https://mastoxiv.page/@arXiv_mathOC_bot/116046008531918566
- Efficient Adaptive Data Analysis over Dense Distributions
Joon Suk Huh
https://arxiv.org/abs/2602.07732 https://mastoxiv.page/@arXiv_csLG_bot/116046380158677039
- Wheeler Bisimulations
Nicola Cotumaccio
https://arxiv.org/abs/2602.07964 https://mastoxiv.page/@arXiv_csFL_bot/116045203254419984
- Trellis codes with a good distance profile constructed from expander graphs
Yubin Zhu, Zitan Chen
https://arxiv.org/abs/2602.08718 https://mastoxiv.page/@arXiv_csIT_bot/116046151403913561
- Near-optimal Swap Regret Minimization for Convex Losses
Lunjia Hu, Jon Schneider, Yifan Wu
https://arxiv.org/abs/2602.08862 https://mastoxiv.page/@arXiv_csLG_bot/116046574152052711
- Distortion of Metric Voting with Bounded Randomness
Ziyi Cai, D. D. Gao, Prasanna Ramakrishnan, Kangning Wang
https://arxiv.org/abs/2602.08871 https://mastoxiv.page/@arXiv_csGT_bot/116045826992016756
toXiv_bot_toot

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 21343 nodes and 86850 edges.
Tags: Technological, Communication, Unweighted, Temporal

Shortest Paths in Geodesic Unit-Disk Graphs
Bruce W. Brewer, Haitao Wang
https://arxiv.org/abs/2603.24872 https://arxiv.org/pdf/2603.24872

Replaced article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Sensitivity and Hamming graphs
Sara Asensio, Yuval Filmus, Ignacio Garc\'ia-Marco, Kolja Knauer

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

GraphWalker: Agentic Knowledge Graph Question Answering via Synthetic Trajectory Curriculum
Shuwen Xu, Yao Xu, Jiaxiang Liu, Chenhao Yuan, Wenshuo Peng, Jun Zhao, Kang Liu
https://arxiv.org/abs/2603.28533 https://arxiv.org/pdf/2603.28533 https://arxiv.org/html/2603.28533
arXiv:2603.28533v1 Announce Type: new
Abstract: Agentic knowledge graph question answering (KGQA) requires an agent to iteratively interact with knowledge graphs (KGs), posing challenges in both training data scarcity and reasoning generalization. Specifically, existing approaches often restrict agent exploration: prompting-based methods lack autonomous navigation training, while current training pipelines usually confine reasoning to predefined trajectories. To this end, this paper proposes \textit{GraphWalker}, a novel agentic KGQA framework that addresses these challenges through \textit{Automated Trajectory Synthesis} and \textit{Stage-wise Fine-tuning}. GraphWalker adopts a two-stage SFT training paradigm: First, the agent is trained on structurally diverse trajectories synthesized from constrained random-walk paths, establishing a broad exploration prior over the KG; Second, the agent is further fine-tuned on a small set of expert trajectories to develop reflection and error recovery capabilities. Extensive experiments demonstrate that our stage-wise SFT paradigm unlocks a higher performance ceiling for a lightweight reinforcement learning (RL) stage, enabling GraphWalker to achieve state-of-the-art performance on CWQ and WebQSP. Additional results on GrailQA and our constructed GraphWalkerBench confirm that GraphWalker enhances generalization to out-of-distribution reasoning paths. The code is publicly available at https://github.com/XuShuwenn/GraphWalker
toXiv_bot_toot

Cubic factor-invariant graphs of bialternating cycle quotient type
Primo\v{z} \v{S}parl
https://arxiv.org/abs/2601.11067 https://arxiv.org/pdf/2601.11067

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang
https://arxiv.org/abs/2411.09979 https://mastoxiv.page/@arXiv_csDS_bot/113502653187863544
- A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
William Kuszmaul
https://arxiv.org/abs/2501.03488 https://mastoxiv.page/@arXiv_csDS_bot/113791396712128907
- The Structural Complexity of Matrix-Vector Multiplication
Emile Anand, Jan van den Brand, Rose McCarty
https://arxiv.org/abs/2502.21240 https://mastoxiv.page/@arXiv_csDS_bot/114097340825270885
- Clustering under Constraints: Efficient Parameterized Approximation Schemes
Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
https://arxiv.org/abs/2504.06980 https://mastoxiv.page/@arXiv_csDS_bot/114312444050875805
- Minimizing Envy and Maximizing Happiness in Graphical House Allocation
Anubhav Dhar, Ashlesha Hota, Palash Dey, Sudeshna Kolay
https://arxiv.org/abs/2505.00296 https://mastoxiv.page/@arXiv_csDS_bot/114437013364446063
- Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
https://arxiv.org/abs/2505.12600 https://mastoxiv.page/@arXiv_csDS_bot/114538936921930134
- Compressing Suffix Trees by Path Decompositions
Becker, Cenzato, Gagie, Kim, Koerkamp, Manzini, Prezza
https://arxiv.org/abs/2506.14734 https://mastoxiv.page/@arXiv_csDS_bot/114703384646892523
- Improved sampling algorithms and functional inequalities for non-log-concave distributions
Yuchen He, Zhehan Lei, Jianan Shao, Chihao Zhang
https://arxiv.org/abs/2507.11236 https://mastoxiv.page/@arXiv_csDS_bot/114862112197588124
- Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
https://arxiv.org/abs/2507.11257 https://mastoxiv.page/@arXiv_csDS_bot/114862223634372292
- Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
Santhoshini Velusamy, Huacheng Yu
https://arxiv.org/abs/2509.07286 https://mastoxiv.page/@arXiv_csDS_bot/115178875220889588
- Uncrossed Multiflows and Applications to Disjoint Paths
Chandra Chekuri, Guyslain Naves, Joseph Poremba, F. Bruce Shepherd
https://arxiv.org/abs/2511.00254 https://mastoxiv.page/@arXiv_csDS_bot/115490402963680492
- Dynamic Matroids: Base Packing and Covering
Tijn de Vos, Mara Grilnberger
https://arxiv.org/abs/2511.15460 https://mastoxiv.page/@arXiv_csDS_bot/115580946319285096
- Branch-width of connectivity functions is fixed-parameter tractable
Tuukka Korhonen, Sang-il Oum
https://arxiv.org/abs/2601.04756 https://mastoxiv.page/@arXiv_csDS_bot/115864074799755995
- CoinPress: Practical Private Mean and Covariance Estimation
Sourav Biswas, Yihe Dong, Gautam Kamath, Jonathan Ullman
https://arxiv.org/abs/2006.06618
- The Ideal Membership Problem and Abelian Groups
Andrei A. Bulatov, Akbar Rafiey
https://arxiv.org/abs/2201.05218
- Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation
Daksh Shami
https://arxiv.org/abs/2407.19575 https://mastoxiv.page/@arXiv_quantph_bot/112874282709517475
- Young domination on Hamming rectangles
Janko Gravner, Matja\v{z} Krnc, Martin Milani\v{c}, Jean-Florent Raymond
https://arxiv.org/abs/2501.03788 https://mastoxiv.page/@arXiv_mathCO_bot/113791421814248215
- On the Space Complexity of Online Convolution
Joel Daniel Andersson, Amir Yehudayoff
https://arxiv.org/abs/2505.00181 https://mastoxiv.page/@arXiv_csCC_bot/114437005955255553
- Universal Solvability for Robot Motion Planning on Graphs
Anubhav Dhar, Pranav Nyati, Tanishq Prasad, Ashlesha Hota, Sudeshna Kolay
https://arxiv.org/abs/2506.18755 https://mastoxiv.page/@arXiv_csCC_bot/114737342714568702
- Colorful Minors
Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
https://arxiv.org/abs/2507.10467
- Learning fermionic linear optics with Heisenberg scaling and physical operations
Aria Christensen, Andrew Zhao
https://arxiv.org/abs/2602.05058
toXiv_bot_toot

The outcome of a bunch of shader tuning last night: the upsample filter (4x sin(x/x) from 20M to 80M points in this test) went from 6.55 ms to 1.5 ms.
Original: 8% of peak DRAM read BW, 31% write, 14% L2$ hit rate.
New (just changed memory access patterns to be more coalesce/cache friendly): 9% read, 37% write, 73% L2$ hit
A similar memory ordering optimization cut the PAM edge detector from about 14 to 10 ms but my SM occupancy is still crap (around 12% of warp slots used)…

On 16WW Data Collections and Graphs - Open for research home #dataset - https://m.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

On 16WW Data Collections and Graphs - Open for research home #dataset - https://m.earth.org.uk/note-on-data.html

On 16WW Data Collections and Graphs
Open for research home #dataset

Unsplittable Transshipments
Srinwanti Debgupta, Sarah Morell, Martin Skutella
https://arxiv.org/abs/2602.07230 https://arxiv.org/pdf/2602.07230 https://arxiv.org/html/2602.07230
arXiv:2602.07230v1 Announce Type: new
Abstract: We introduce the Unsplittable Transshipment Problem in directed graphs with multiple sources and sinks. An unsplittable transshipment routes given supplies and demands using at most one path for each source-sink pair. Although they are a natural generalization of single source unsplittable flows, unsplittable transshipments raise interesting new challenges and require novel algorithmic techniques. As our main contribution, we give a nontrivial generalization of a seminal result of Dinitz, Garg, and Goemans (1999) by showing how to efficiently turn a given transshipment $x$ into an unsplittable transshipment $y$ with $y_a<x_a d_{\max}$ for all arcs $a$, where $d_{\max}$ is the maximum demand (or supply) value. Further results include bounds on the number of rounds required to satisfy all demands, where each round consists of an unsplittable transshipment that routes a subset of the demands while respecting arc capacity constraints.
toXiv_bot_toot

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4854 nodes and 10098 edges.
Tags: Technological, Communication, Unweighted, Temporal

Highly regular vertex-transitive graphs are globally rigid
Angelo El Saliby
https://arxiv.org/abs/2601.11240 https://arxiv.org/pdf/2601.11240

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
Christian Rosenke, Mark Scheibner
https://arxiv.org/abs/2602.00690 https://arxiv.org/pdf/2602.00690 https://arxiv.org/html/2602.00690
arXiv:2602.00690v1 Announce Type: new
Abstract: Inspired by the eponymous hobby, we introduce Miniature Painting as the computational problem to paint a given graph $G=(V,E)$ according to a prescribed template $t \colon V \rightarrow C$, which assigns colors $C$ to the vertices of $G$. In this setting, the goal is to realize the template using a shortest possible sequence of brush strokes, where each stroke overwrites a connected vertex subset with a color in $C$. We show that this problem is equivalent to a reversal of the well-studied Free Flood-It game, in which a colored graph is decolored into a single color using as few moves as possible. This equivalence allows known complexity results for Free Flood-It to be transferred directly to Miniature Painting, including NP-hardness under severe structural restrictions, such as when $G$ is a grid, a tree, or a split graph. Our main contribution is a polynomial-time algorithm for Miniature Painting on graphs that are free of induced co-gems, a graph class that strictly generalizes cographs. As a direct consequence, Free Flood-It is also polynomial-time solvable on co-gem-free graphs, independent of the initial coloring.
toXiv_bot_toot

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 22270 nodes and 90820 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3774 nodes and 7498 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4936 nodes and 10400 edges.
Tags: Technological, Communication, Unweighted, Temporal

Hardness and Tractability of T_{h 1}-Free Edge Deletion
Ajinkya Gaikwad, Soumen Maity, Leeja R
https://arxiv.org/abs/2602.00644 https://arxiv.org/pdf/2602.00644 https://arxiv.org/html/2602.00644
arXiv:2602.00644v1 Announce Type: new
Abstract: We study the parameterized complexity of the T(h 1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected component of the resulting graph has size at most h. The problem is NP-complete for every fixed h at least 3, while it is solvable in polynomial time for h at most 2.
Recent work showed strong hardness barriers: the problem is W[1]-hard when parameterized by the solution size together with the size of a feedback edge set, ruling out fixed-parameter tractability for many classical structural parameters. We significantly strengthen these negative results by proving W[1]-hardness when parameterized by the vertex deletion distance to a disjoint union of paths, the vertex deletion distance to a disjoint union of stars, or the twin cover number. These results unify and extend known hardness results for treewidth, pathwidth, and feedback vertex set, and show that several restrictive parameters, including treedepth, cluster vertex deletion number, and modular width, do not yield fixed-parameter tractability when h is unbounded.
On the positive side, we identify parameterizations that restore tractability. We show that the problem is fixed-parameter tractable when parameterized by cluster vertex deletion together with h, and also when parameterized by neighborhood diversity together with h via an integer linear programming formulation. We further present a fixed-parameter tractable bicriteria approximation algorithm parameterized by k. Finally, we show that the problem admits fixed-parameter tractable algorithms on split graphs and interval graphs, and we establish hardness for a directed generalization even on directed acyclic graphs.
toXiv_bot_toot

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16726 nodes and 47594 edges.
Tags: Social, Collaboratio…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 40421 nodes and 175692 edges.
Tags: Social, Collaborati…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 5138 nodes and 10825 edges.
Tags: Technological, Communication, Unweighted, Temporal

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 40421 nodes and 175692 edges.
Tags: Social, Collaborati…

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4897 nodes and 10307 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3701 nodes and 7329 edges.
Tags: Technological, Communication, Unweighted, Temporal

A polynomial-time algorithm for recognizing high-bandwidth graphs
Luis M. B. Varona
https://arxiv.org/abs/2602.01755 https://arxiv.org/pdf/2602.01755 https://arxiv.org/html/2602.01755
arXiv:2602.01755v1 Announce Type: new
Abstract: An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have labels that differ by more than $k$. It is known that one can decide whether the bandwidth of $G$ is at most $k$ in $O(n^k)$ time and $O(n^k)$ space using dynamic programming techniques. For small $k$ close to $0$, this approach is effectively polynomial, but as $k$ scales with $n$, it becomes superexponential, requiring up to $O(n^{n - 1})$ time (where $n - 1$ is the maximum possible bandwidth). In this paper, we reformulate the problem in terms of bipartite matching for sufficiently large $k \ge \lfloor (n - 1)/2 \rfloor$, allowing us to use Hall's marriage theorem to develop an algorithm that runs in $O(n^{n - k 1})$ time and $O(n)$ auxiliary space (beyond storage of the input graph). This yields polynomial complexity for large $k$ close to $n - 1$, demonstrating that the bandwidth recognition problem is solvable in polynomial time whenever either $k$ or $n - k$ remains small.
toXiv_bot_toot

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 25158 nodes and 102468 edges.
Tags: Technological, Communication, Unweighted, Temporal

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 18740 nodes and 77002 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3630 nodes and 7200 edges.
Tags: Technological, Communication, Unweighted, Temporal

Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- A Fault-Tolerant Version of Safra's Termination Detection Algorithm
Wan Fokkink, Georgios Karlos, Andy Tatman
https://arxiv.org/abs/2602.00272 https://mastoxiv.page/@arXiv_csDC_bot/116005743114928343
- Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney
https://arxiv.org/abs/2602.00657 https://mastoxiv.page/@arXiv_csCC_bot/116005533092908045
- Sublinear Time Quantum Algorithm for Attention Approximation
Zhao Song, Jianfei Xue, Jiahao Zhang, Lichen Zhang
https://arxiv.org/abs/2602.00874 https://mastoxiv.page/@arXiv_quantph_bot/116006587128552159
- Hallucination is a Consequence of Space-Optimality: A Rate-Distortion Theorem for Membership Testing
Anxin Guo, Jingwei Li
https://arxiv.org/abs/2602.00906 https://mastoxiv.page/@arXiv_csLG_bot/116006973804501595
- Counting Unit Circular Arc Intersections
Haitao Wang
https://arxiv.org/abs/2602.01074 https://mastoxiv.page/@arXiv_csCG_bot/116005535191670040
- Profit Maximization in Closed Social Networks
Poonam Sharma, Suman Banerjee
https://arxiv.org/abs/2602.01232 https://mastoxiv.page/@arXiv_csSI_bot/116005691056225955
- Totally $\Delta$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
Caleb McFarland
https://arxiv.org/abs/2602.01499 https://mastoxiv.page/@arXiv_mathCO_bot/116006381339684193
- Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex A...
Taihei Oki, Shinsaku Sakaue
https://arxiv.org/abs/2602.01682 https://mastoxiv.page/@arXiv_csLG_bot/116007186801693076
- Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
Samuel McCauley, Benjamin Moseley, Helia Niaparast, Shikha Singh
https://arxiv.org/abs/2602.02254 https://mastoxiv.page/@arXiv_csGT_bot/116005915605630934
- Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Wor...
Thomas M. Prinz, Christopher T. Schwanen, Wil M. P. van der Aalst
https://arxiv.org/abs/2602.02447 https://mastoxiv.page/@arXiv_csFL_bot/116005733006023408
toXiv_bot_toot

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4407 nodes and 8932 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3670 nodes and 7251 edges.
Tags: Technological, Communication, Unweighted, Temporal

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 23390 nodes and 92190 edges.
Tags: Technological, Communication, Unweighted, Temporal

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Optimal Hardness of Online Algorithms for Large Independent Sets
David Gamarnik, Eren C. K{\i}z{\i}lda\u{g}, Lutz Warnke
https://arxiv.org/abs/2504.11450 https://mastoxiv.page/@arXiv_csDS_bot/114346418465357434
- An Approximation Algorithm for Monotone Submodular Cost Allocation
Ryuhei Mizutani
https://arxiv.org/abs/2511.00470 https://mastoxiv.page/@arXiv_csDS_bot/115490466535056736
- Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
Md. Rawha Siddiqi Riad, Md. Tanzeem Rahat, Md. Manzurul Hasan
https://arxiv.org/abs/2512.00506 https://mastoxiv.page/@arXiv_csDS_bot/115648910775471187
- Nested and outlier embeddings into trees
Shuchi Chawla, Kristin Sheridan
https://arxiv.org/abs/2601.15470 https://mastoxiv.page/@arXiv_csDS_bot/115943420904659985
- Bankrupting DoS Attackers
Trisha Chakraborty, Abir Islam, Valerie King, Daniel Rayborn, Jared Saia, Maxwell Young
https://arxiv.org/abs/2205.08287
- An Algorithm for Fast and Correct Computation of Reeb Spaces for PL Bivariate Fields
Amit Chattopadhyay, Yashwanth Ramamurthi, Osamu Saeki
https://arxiv.org/abs/2403.06564 https://mastoxiv.page/@arXiv_csCG_bot/112081476174323525
- On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact...
Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar
https://arxiv.org/abs/2410.07388 https://mastoxiv.page/@arXiv_csSI_bot/113287589348257824
- A New Quantum Linear System Algorithm Beyond the Condition Number and Its Application to Solving ...
Jianqiang Li
https://arxiv.org/abs/2510.05588 https://mastoxiv.page/@arXiv_quantph_bot/115337999786748703
- On Purely Private Covariance Estimation
Tommaso d'Orsi, Gleb Novikov
https://arxiv.org/abs/2510.26717 https://mastoxiv.page/@arXiv_csLG_bot/115468358153466988
- The Query Complexity of Local Search in Rounds on General Graphs
Simina Br\^anzei, Ioannis Panageas, Dimitris Paparas
https://arxiv.org/abs/2601.13266 https://mastoxiv.page/@arXiv_csCC_bot/115932039505257286
toXiv_bot_toot

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 31 nodes and 98 edges.
Tags: Social, Fictional, Weighted

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 34 nodes and 171 edges.
Tags: Social, Fictional, Weighted

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 35 nodes and 75 edges.
Tags: Social, Fictional, Weighted

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 35 nodes and 96 edges.
Tags: Social, Fictional, Weighted

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 27 nodes and 45 edges.
Tags: Social, Fictional, Weighted