Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
A 2-packing set for an undirected graph $G=(V,E)$ is defined as a subset $\mathcal{S}\subseteq V$ such that for each pair of vertices $v_1 \neq v_2 \in \mathcal{S}$, the shortest path between $v_1$ and $v_2$ has at least length three. Finding a 2-packing set of maximum cardinality is an NP-hard prob...
Saved in:
| Published in: | Journal of graph algorithms and applications Vol. 29; no. 1; pp. 159 - 186 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
02.07.2025
|
| ISSN: | 1526-1719, 1526-1719 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!