arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.18984math.COcs.DM
收藏

图燃烧:界与难度

Graph Burning: Bounds and Hardness

Indian Institute of Science(印度科学学院);Indian Institute of Science Education and Research, Thiruvananthapuram(印度科学教育与研究学院(特里凡得琅));Manipal Academy of Higher Education(马纳帕高等教育学院);Indian Institute of Technology Delhi(德里印度理工学院);Kyoto University(京都大学)

Dhanyamol Antony, L. Sunil Chandran, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva

AI总结:

本文研究图燃烧问题的算法与结构特性,证明其在连通proper区间图上仍为NP难,并改进了连通P_k-自由图的燃烧数上界,同时探讨了边燃烧和总燃烧的变体及其计算复杂性。

摘要:

图燃烧是一种离散时间过程,用于建模网络中的信息传播。初始时,有一个未燃烧的无向图。在每个时间步,选择一个未燃烧的顶点进行燃烧;此外,至少有一个之前步骤中被燃烧的邻居的未燃烧顶点也会被燃烧。一旦顶点被燃烧,它将保持燃烧状态。图的燃烧数是将所有顶点燃烧所需的最少步骤数。燃烧数问题询问给定图G的燃烧数是否不超过k。在本文中,我们从算法和结构的角度研究燃烧数问题。已知燃烧数问题在区间图上是NP难的。这里,我们证明即使在连通proper区间图上,该问题仍然是NP难的。众所周知的燃烧数猜想断言,连通图的燃烧数不超过⌈√n⌉。与该猜想一致,各种图类的燃烧数上界和下界已得到广泛研究。这里,我们为连通P_k-自由图提供了改进的燃烧数上界,并证明该界在加法常数1以内是紧的。最后,我们研究了问题的两个变种:边燃烧和总燃烧。我们建立了这些变种与经典燃烧的关系,并评估了这些变种的算法复杂性。

英文摘要:

Graph burning is a discrete-time process that models the propagation of information in a network. Given an undirected graph whose vertices are initially unburned, the process evolves in discrete rounds. At each round, an unburned vertex is selected and burned, while any unburned vertex adjacent to a vertex burned in the previous round also becomes burned. The burning number of a graph is the minimum number of steps to burn all its vertices. The BURNING NUMBER PROBLEM asks whether the burning number of an input graph $G$ is at most $k$. In this paper, we investigate the graph burning problem from both algorithmic and structural viewpoints. Although the problem is known to be NP-complete on interval graphs, we strengthen this result by proving that it remains NP-complete even when restricted to connected proper interval graphs. We also study the burning number of $P_k$-free graphs. Motivated by the well-known burning number conjecture, which states that every connected graph of order $n$ has burning number at most $\lceil \sqrt{n}~\rceil$, we establish an improved upper bound for connected $P_k$-free graphs and show that this bound is tight up to an additive constant of $1$. Finally, we study two variants of the problem: edge burning and total burning. We establish fundamental relationships between these variants and the classical burning, and we determine the computational complexity of the corresponding decision problems.

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

↑