Parameterized Complexity of Geodetic Set
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb{N}$, the NP-hard ${\rm G{\small EODETIC}~S{ \small ET}}$ problem asks whether there is a geodetic set of size at most $k$. Complementing variou...
Saved in:
| Published in: | Journal of graph algorithms and applications Vol. 26; no. 4; pp. 401 - 419 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.07.2022
|
| 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!