In this work, we propose Maximal-2-Packing-Halin, a distributed algorithm that finds a maximal 2-packing set in undirected non-geometric Halin graphs of order $n$ in linear time. First, this algorithm finds an external face of the input graph through the application of graph-reduction rules. Second, each vertex determines if it belongs to a maximal 2-packing set by applying a set of vertex-coloring rules.

中文翻译：

---

Halin图中最大2填充集的​​分布式算法

在这项工作中，我们提出了Maximal-2-Packing-Halin，这是一种分布式算法，可以在无序非有序Halin图图中找到最大2个装箱集$ñ$在线性时间内。首先，该算法通过应用图归约规则来找到输入图的外表面。其次，每个顶点通过应用一组顶点着色规则来确定其是否属于最大2填充集。