.png){kind=icon}
.png){kind=icon}
Return
A distributed algorithm for a maximal 2-packing set in Halin graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2020.03.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2020 Elsevier Inc. All rights reserved.
Keywords:
Maximal 2-packing set
Halin graph
Distributed algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K