arXiv math/94112221994-11-18math.COcs.CC

The complexity of broadcasting in bounded-degree networks

Michael J. Dinneen

备注：: 6 pages

英文摘要：

Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the communication lines of the network between neighboring nodes, where each call requires a unit of time and a call can involve only two nodes. We show that for bounded-degree networks determining the minimum broadcast time from an originating node remains NP-complete.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On Broadcasting Time in the Model of Travelling Agents

Consider the following broadcasting process run on a connected graph $G=(V,E)$. Suppose that $k \ge 2$ agents start on vertices selected from $V$ uniformly and independently at random. One of the agents has a message that she wants to communicate to the other agents. All agents perform independent random walks on $G$, with the message being passed when an agent that knows the message meets an agent that does not know the message. The broadcasting time $ξ(G,k)$ is the time it takes to spread the message to all agents. Our ultimate goal is to gain a better understanding of the broadcasting proce…

2020-03-18cs.SImath.COmath.PR

Conflict complexity is lower bounded by block sensitivity

We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity. We propose to compare conflict complexity with certificate complexity, and explain why it could be interesting.

2020-05-11cs.CCmath.CO

On additive complexity of infinite words

We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded by a constant that depends only on the word. We describe how bounded additive complexity impacts the slope of the word and how a non-erasing morphism may affect the boundedness of a given word's additive complexity. We prove the existence of recurrent words with constant additive complexity equal to any given odd positive integer. In the last section, we dis…

2012-09-21math.CO

将图分解为一个匹配和一个有界线性森林的复杂度

The complexity of decomposing a graph into a matching and a bounded linear forest

本文研究了图边分解为匹配与有界线性森林或有界星森林的复杂度，证明了前者对所有 $k \ge 3$ 均为 NP 完全，而后者对所有 $k$ 均可多项式求解。

2023-04-06cs.CCmath.CO

Characterising Bounded Expansion by Neighbourhood Complexity

We show that a graph class $\cal G$ has bounded expansion if and only if it has bounded $r$-neighbourhood complexity, i.e. for any vertex set $X$ of any subgraph $H$ of $G\in\cal G$, the number of subsets of $X$ which are exact $r$-neighbourhoods of vertices of $H$ on $X$ is linear to the size of $X$. This is established by bounding the $r$-neighbourhood complexity of a graph in terms of both its $r$-centred colouring number and its weak $r$-colouring number, which provide known characterisations to the property of bounded expansion.

2016-11-02cs.DMmath.CO

有界 Merge-Width 图的 χ-有界性与邻域复杂度

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs

本文研究有界 merge-width 图，证明其兼具 χ-有界性、强 Erdős-Hajnal 性质和线性邻域复杂度，揭示该新图宽度参数与有界扩张和 twin-width 的共性。

2025-06-16cs.DMmath.CO

更多相关论文收起更多论文

The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth

We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromatic Number are fixed parameter tractable, parameterised by treewidth, whereas List Hamilton Path is W[1]-hard, even parameterised by pathwidth. These results resolve two open questions of Fellows, Fomin, Lokshtanov, Rosamond, Saurabh, Szeider and Thomassen (2011).

2016-08-04cs.CCcs.DMcs.DS

Avoiding Abelian powers in binary words with bounded Abelian complexity

The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian $k$-powers for some integer $k$, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian $k$-powers occur in a word having bounded Abelian complexity? In particular, does every uniformly recurrent word having bounded Abelian complexity begin in an Abelian $k$-power? While this is true for various classes of unif…

2010-05-14cs.DMmath.CO

Generalized distance domination problems and their complexity on graphs of bounded mim-width

We generalize the family of $(σ, ρ)$-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-$r$ dominating set and distance-$r$ independent set. We show that these distance problems are XP parameterized by the structural parameter mim-width, and hence polynomial on graph classes where mim-width is bounded and quickly computable, such as $k$-trapezoid graphs, Dilworth $k$-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, $k$-polygon graphs,…

2018-07-11cs.CCcs.DMmath.CO

有界多斜率情形下的和差指数与有理复杂度

Sum-difference exponents for boundedly many slopes, and rational complexity

本文受AlphaEvolve数值探索启发，研究斜率集基数有界情形下的和差指数，证明其以s相对于R的有理复杂度控制的速率收敛到2。

2025-11-19math.CO

具有线性邻域复杂度的奇 coloring 图

Odd coloring graphs with linear neighborhood complexity

Institute of Theoretical Informatics, Karlsruhe Institute of Technology（卡尔斯鲁厄理工学院理论信息学研究所）

该研究证明了具有线性邻域复杂度的图类具有有界不良奇色数，并展示了圆图、双宽度有界类等情形下的结论。

2026-02-11cs.DMmath.CO

On abelian and additive complexity in infinite words

The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We provide an alternative proof of one of the results of Richomme, Saari, and Zamboni.

2011-07-23math.CO

On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs

For a connected graph $G=(V,E)$, a matching $M\subseteq E$ is a matching cut of $G$ if $G-M$ is disconnected. It is known that for an integer $d$, the corresponding decision problem Matching Cut is polynomial-time solvable for graphs of diameter at most $d$ if $d\leq 2$ and NP-complete if $d\geq 3$. We prove the same dichotomy for graphs of bounded radius. For a graph $H$, a graph is $H$-free if it does not contain $H$ as an induced subgraph. As a consequence of our result, we can solve Matching Cut in polynomial time for $P_6$-free graphs, extending a recent result of Feghali for $P_5$-free g…

2022-07-15cs.CCcs.DMcs.DS

具有有界整数松弛矩阵的多面体具有次指数扩展复杂度

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity

本文证明了具有有界整数松弛矩阵的多面体具有次指数级别的扩展复杂度，通过分析有界整数函数的确定性通信复杂度得出该结论。

2024-03-20cs.DMmath.CO

关于有界VC-极小复杂度图的强Erdős-Hajnal性质的注记

A note on strong Erdős-Hajnal for graphs with bounded VC-minimal complexity

受Adler的VC极小理论思路启发，研究者引入VC-极小复杂度概念，证明了有界VC-极小复杂度的有限二部图满足强Erdős-Hajnal性质，即存在正比例大小的二部子集构成完全二部子图或空二部子图。

2024-03-10math.COmath.LO

Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations

The study of Armstrong codes is motivated by the problem of understanding complexities of dependencies in relational database systems, where attributes have bounded domains. A $(q,k,n)$-Armstrong code is a $q$-ary code of length $n$ with minimum Hamming distance $n-k+1$, and for any set of $k-1$ coordinates there exist two codewords that agree exactly there. Let $f(q,k)$ be the maximum $n$ for which such a code exists. In this paper, $f(q,3)=3q-1$ is determined for all $q\geq 5$ with three possible exceptions. This disproves a conjecture of Sali. Further, we introduce generalized Armstrong cod…

2019-06-14cs.ITmath.COmath.IT