跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 05:05 — 2026-11-17 05:05(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
新论文 · v1arXiv:2611.11376

Fractional distance-edge-monitoring in lexicographic products

Xiumin Wang, Minglei Mao, Yaping Mao, Ralf Klasing

原文摘要

We give an exact formula for the fractional distance-edge-monitoring number of $G\circ H$, where $G$ is connected of order $m\ge2$ and $H$ has order $n\ge2$. By the previously established endpoint-monitoring property, the fractional monitoring program reduces to fractional vertex cover, whose linear-programming dual is fractional matching. Writing $d_c(H)$ for the critical difference of $H$, we obtain $\operatorname{dem}_{f}(G\circ H)=(mn-D(G,H))/2$, where $D(G,H)=\max_{A\in\mathcal{I}(G)}\bigl(d_c(H)|A|-n|N_G(A)|\bigr)$ and $\mathcal{I}(G)$ denotes the family of all independent sets of $G$, including the empty set, while $N_G(A)$ is the open neighborhood of $A$. This formula characterizes the products attaining $mn/2$ and gives an equality criterion for the fractional matching lower bound of Ma, Cheng, Mao and Wang. Under the stated hypotheses, the lower bound of Ma et al. is attained if and only if either factor has a fractional perfect matching or $H$ is edgeless. Two outer trees show that the factor orders and fractional matching numbers do not determine the product value.

cs.DM

新论文 · v1arXiv:2611.05144

Recognizing Label-Connected Graphs

Ralf Klasing, George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis

原文摘要

In classical gossiping, each participant initially knows a distinct piece of information. Whenever two participants call each other, they exchange everything they know. We study Gossiping: given an undirected multigraph whose vertices represent participants and whose edges represent available calls, decide whether the calls can be ordered so that every participant learns all information, using each edge at most once. Equivalently, can one time label per edge make the graph temporally connected by strict temporal paths? This recognition problem is NP-complete; we study its parameterized complexity. After linear-time preprocessing, we give an exact $O(3^{n/3}n^3)$-time algorithm and a deterministic $2^{O(tw)}n$-time algorithm, where $n$ is the number of vertices and $tw$ is the treewidth of the underlying simple graph. We introduce a Tree Contraction Rule that extends the treewidth algorithm to single-exponential algorithms for parameters that may remain small on dense graphs, such as tree-independence number and clique-width, without requiring a decomposition as input. For the excess $δ=m-(2n-4)$ over the minimum number of calls, where $m$ is the number of edges, we give a randomized $2^{O(δ)}n^3$-time algorithm with one-sided error. Its main subroutine solves Rooted Independent Cycle: finding a cycle through four prescribed vertices whose edges are independent in a represented linear matroid. We solve this problem deterministically in $2^{O(r)}m$ arithmetic operations over the finite field representing the matroid, where $r$ is its rank. Gossiping is polynomial-time solvable at maximum degree four, counting parallel edges, but NP-complete on planar simple graphs of maximum degree five. The treewidth algorithm yields a $2^{O(\sqrt n)}$-time algorithm on planar graphs.

cs.DS · cs.DM