2023
DOI: 10.1051/ita/2023002
|View full text |Cite
|
Sign up to set email alerts
|

On the computational difficulty of the terminal connection problem

Abstract: A connection tree of a graph G for a terminal set W is a tree subgraph T of G such that leaves(T) ⊆ W ⊆ V(T). A non-terminal vertex is called linker if its degree in T is exactly 2, and it is called router if its degree in T is at least 3. The Terminal connection problem (TCP) asks whether G admits a connection tree for W with at most ℓ linkers and at most r routers, while the Steiner tree problem asks whether G admits a connection tree for W with at most k non-terminal vertices. We prove that, if r ≥ 1 is fix… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…The NP-completeness proof for TCP on chordal bipartite graphs were published in , and all the other mentioned results were published in [de Melo et al 2020, de Melo et al 2021a, de Melo et al 2023]. In particular, in [de Melo et al 2020], we analyse the complexity of S-TCP, the strict variant of TCP.…”
Section: Connection Problemsmentioning
confidence: 99%
“…The NP-completeness proof for TCP on chordal bipartite graphs were published in , and all the other mentioned results were published in [de Melo et al 2020, de Melo et al 2021a, de Melo et al 2023]. In particular, in [de Melo et al 2020], we analyse the complexity of S-TCP, the strict variant of TCP.…”
Section: Connection Problemsmentioning
confidence: 99%